A Hybrid Two-Stage flowshop Scheduling Problem

This paper considers a batch scheduling problem in a two-stage hybrid flowshop that consists of m dedicated parallel machines in stage 1 and a batch processor in stage 2. The processing time of a batch is defined as the largest processing time of the jobs contained in that batch. The criterion is to minimize the makespan, the time by which all operations of jobs have been processed. For such a problem, we present a polynomial time algorithm for the case with all jobs having the same processing time on the batch processor. An approximation algorithm with a competitive ratio 2 for the general case is also presented.

[1]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[2]  Kn Krishnaswamy,et al.  Modified heuristic algorithms for scheduling multiple batch processors with incompatible job families , 2001 .

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

[4]  Bertrand M. T. Lin.  The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine , 1999, Comput. Oper. Res..

[5]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[6]  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..

[7]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[8]  Bertrand M. T. Lin,et al.  Two-stage flowshop scheduling with a common second-stage machine , 1997, Comput. Oper. Res..

[9]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

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

[11]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[12]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[13]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[14]  Chris N. Potts,et al.  Scheduling batches with simultaneous job processing for two-machine shop problems , 2001 .