Scheduling a flow-shop with combined buffer conditions

In this paper, No-Wait, No-Buffer, Limited-Buffer, and Infinite-Buffer conditions for the flow-shop problem (FSP) have been investigated. These four different buffer conditions have been combined to generate a new class of scheduling problem, which is significant for modelling many real-world scheduling problems. A new heuristic algorithm is developed to solve this strongly NP-hard problem. Detailed numerical implementations have been analysed and promising results have been achieved.

[1]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

[2]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[3]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[4]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[5]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[6]  Débora P. Ronconi,et al.  Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..

[7]  Erhan Kozan,et al.  A Blocking Parallel-Machine Job-Shop-Scheduling Model for the Train Scheduling Problem , 2007 .

[8]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[9]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[10]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[11]  Shi Qiang Liu,et al.  A comparative study of algorithms for the flowshop scheduling problem , 2002 .

[12]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[13]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[14]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[15]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[16]  Débora P. Ronconi,et al.  A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..

[17]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[18]  Rainer Leisten,et al.  Flowshop sequencing problems with limited buffer storage , 1990 .

[19]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[20]  Michael Pinedo,et al.  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..

[21]  Tapan P. Bagchi,et al.  Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .

[22]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[23]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[24]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[25]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[26]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[27]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .