A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking

This work addresses the minimization of the makespan criterion for the flowshop problem with blocking. In this environment there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm that uses this lower bound is described and its efficiency is evaluated on several problems. Results of computational experiments are reported.

[1]  S. K. Goyal Job-shop sequencing problem with no wait in process , 1975 .

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

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

[4]  B. Norman Scheduling flowshops with finite buffers and sequence-dependent setup times , 1999 .

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

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

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

[8]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[9]  S. S. Reddi,et al.  Note---Sequencing with Finite Intermediate Storage , 1976 .

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

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

[12]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

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

[14]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[15]  Christos H. Papadimitriou,et al.  Flowshop scheduling with limited temporary storage , 1980, JACM.

[16]  Blair J. Berkley Effect of buffer capacity and sequencing rules on single-card kanban system performance , 1993 .

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

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

[19]  Chandrasekharan Rajendran,et al.  Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs : Part 1 , 1996 .

[20]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[21]  Sujit K. Dutta,et al.  Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .

[22]  Richard S. H. Mah,et al.  An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .