In this paper, no-wait job shop problems with makespan minimization are considered. It is well known that these problems are strongly NP-hard. The problem is decomposed into the sequencing and the timetabling components. Shift timetabling is developed for the timetabling component. An effective...

According to spatial distribution of climate disasters in Nanning City and physiological and ecological indicator demands of sugarcane, with the aid of HJ-1 CCD satellite remote sensing images, basic meteorological data and geographic information data, this paper established the model for...

For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The...

In this paper, a HGA (hybrid genetic algorithm) is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are known to be NP-hard. One of the chromosomes in the initial population is constructed by a suitable heuristic and the others are yielded...

In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a...

We build a Markov regime switching model to examine the role of heterogeneous expectations in the forward exchange market, where the regime could be fundamentalists or chartists. Our empirical analysis of EUR/USD and USD/JPY forward markets suggest that the fundamen-talists who follow negative...