Minimizing makespan in a two-machine flowshop scheduling with batching and release time

This paper studies two-machine flowshop scheduling with batching and release time, whose objective is to minimize the makespan. We formulate the scheduling problem as a mixed integer programming model and show that it is a strongly NP-hard problem. We derive a lower bound and develop dynamic programming-based heuristic algorithms to solve the scheduling problem. Computational experiments are carried out to evaluate the performance of the heuristic algorithms. The numerical results show that some of the heuristic algorithms can indeed find effective solutions for the scheduling problem.

[1]  Daniel Oron,et al.  Single machine scheduling with batch-dependent setup times , 2006, Inf. Process. Lett..

[2]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[3]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[4]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[5]  Tamer Eren,et al.  A bicriteria scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[6]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[7]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

[8]  Bertrand M. T. Lin,et al.  Makespan minimization in the two‐machine flowshop batch scheduling problem , 2000 .

[9]  Peter B. Luh,et al.  Steel-making process scheduling using Lagrangian relaxation , 2002 .

[10]  Bertrand M. T. Lin,et al.  Two-Machine Flowshop Batching and Scheduling , 2005, Ann. Oper. Res..

[11]  Jatinder N. D. Gupta,et al.  Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem , 1971, Oper. Res..

[12]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[13]  Lixin Tang,et al.  Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration , 2009 .

[14]  Guoqing Wang,et al.  Batching and scheduling to minimize the makespan in the two-machine flowshop , 1998 .

[15]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[16]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[17]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[18]  Young Hwan Kim,et al.  Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed , 2002, Comput. Oper. Res..

[19]  Lixin Tang,et al.  Decision support system for the batching problems of steelmaking and continuous-casting production , 2008 .