论文信息 - Three stages flow-shop with job over-passing

Three stages flow-shop with job over-passing

In practical task scheduling it is sometimes required that the components of a system perform consecutively. Such scheduling is called without no-idle periods. In this paper, we study a particular case of three workshops where the no-idle constraint is applied only on the second stage. A heuristic is proposed and experimented. This work is then extended and tested for a larger size of problems.

[1] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[2] Jatinder N. D. Gupta,et al. Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[3] J. Gupta,et al. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[4] V. S. Tanaev,et al. Scheduling Theory: Multi-Stage Systems , 1994 .

[5] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[6] Seetuarma L. Narastmhan,et al. Scheduling in a two-stage manufacturing process , 1984 .

[7] Seetharama L. Narasimhan,et al. A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[8] Chelliah Sriskandarajah,et al. Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[9] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

[10] Krzysztof Giaro. NP-hardness of compact scheduling in simplified open and flow shops , 2001, Eur. J. Oper. Res..