A note on constructive heuristics for the flowshop problem with blocking

Abstract This paper analyzes 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. As the problem is NP-hard, a constructive heuristic that explores specific characteristics of the problem is developed. The small computational effort of such strategy, which is valuable in practical applications, is one of the reasons that motivated this study. The performance of a combination of the proposed method with existing ones is examined through a comparative study. The new methods outperform the NEH algorithm, currently the best constructive heuristic for this problem, in problems with up to 500 jobs and 20 machines.

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

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

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

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

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

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

[7]  Yeong-Dae Kim,et al.  Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .

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

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

[10]  Marcelo Seido Nagano,et al.  A high quality solution constructive heuristic for flow shop sequencing , 2002, J. Oper. Res. Soc..

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

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

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

[14]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[15]  S.M.A. Suliman,et al.  A two-phase heuristic approach to the permutation flow-shop scheduling problem , 2000 .

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

[17]  J. Grabowski,et al.  On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness , 1983 .

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