Two-stage hybrid flow shop scheduling with dynamic job arrivals

Motivated by applications in semiconductor manufacturing industry, we consider a two-stage hybrid flow shop where a discrete machine is followed by a batching machine. In this paper, we analyze the computational complexity of a class of two-machine problems with dynamic job arrivals. For the problems belonging to P we present polynomial algorithms. For the NP-complete problems we propose the heuristics, and then establish the upper bounds on the worst case performance ratios of the heuristics. In addition, we give the improved heuristics that can achieve better performances.

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

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

[3]  John W. Fowler,et al.  Real-time control of multiproduct bulk-service semiconductor manufacturing processes , 1992 .

[4]  B.-J. Joo,et al.  A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints , 2009, J. Oper. Res. Soc..

[5]  Jonathan F. Bard,et al.  The use of upstream and downstream information in scheduling semiconductor batch operations , 1995 .

[6]  Tamás Kis,et al.  A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..

[7]  Don T. Phillips,et al.  Control of multiproduct bulk server diffusion/oxidation processes. Part 2: multiple servers , 2000 .

[8]  Abdelhakim Artiba,et al.  Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints , 2004, Comput. Ind. Eng..

[9]  R. C. Leachman,et al.  An improved methodology for real-time production decisions at batch-process work stations , 1993 .

[10]  Lixin Tang,et al.  Flowshop scheduling problems with transportation or deterioration between the batching and single machines , 2009, Comput. Ind. Eng..

[11]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[12]  H AhmadiJavad,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992 .

[13]  Reha Uzsoy,et al.  Scheduling batch processing machines with incompatible job families , 1995 .

[14]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

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

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

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

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

[19]  Bertrand M. T. Lin,et al.  Batch scheduling in the no-wait two-machine flowshop to minimize the makespan , 2001, Comput. Oper. Res..

[20]  D. Yang,et al.  A two-machine flowshop sequencing problem with limited waiting time constraints , 1995 .

[21]  Ling-Huey Su,et al.  Sequencing two-stage flowshop with nonidentical job sizes , 2010 .

[22]  Young Hwan Kim,et al.  A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines , 2000, Eur. J. Oper. Res..

[23]  Maw-Sheng Chern,et al.  A TWO-MACHINE MULTI-FAMILY FLOWSHOP SCHEDULING PROBLEM WITH TWO BATCH PROCESSORS , 2001 .

[24]  L. Su.  A hybrid two-stage flowshop with limited waiting time constraints , 2003 .

[25]  Ammar Oulamara.  Makespan minimization in a no-wait flow shop problem with two batching machines , 2007, Comput. Oper. Res..