Hybrid flow shop scheduling with parallel batching

In this research the problem of parallel batch scheduling in a hybrid flow shop environment with minimizing Cmax is studied. In parallel batching it is assumed that machines in some stages are able to process a number of operations simultaneously. Since the problem is NP-hard, three heuristic algorithms are developed to give near optimal solutions. Since this problem has not been studied previously, therefore, a lower bound is developed for evaluating the performance of the proposed heuristics. Several test problems have been solved using these heuristics and results compared. To further enhance the solution quality, a three dimensional genetic algorithm (3DGA) is also developed. Several test problems have been solved using 3DGA and the results indicate its superiority to the other heuristics.

[1]  T. C. Edwin Cheng,et al.  The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan , 2004, Oper. Res. Lett..

[2]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[3]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[4]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[5]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .

[6]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[7]  Daniel Quadt,et al.  Batch scheduling of jobs with identical process times on flexible flow lines , 2007 .

[8]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[9]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

[10]  T. Sawik.  An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers , 2002 .

[11]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[12]  Clyde L. Monma,et al.  Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..

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

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

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

[16]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

[17]  Jinjiang Yuan,et al.  Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost , 2006 .

[18]  Stefan Voß,et al.  Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application , 2007 .

[19]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[20]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

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

[22]  John L. Hunsucker,et al.  A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage , 2004, Eur. J. Oper. Res..

[23]  Yih-Long Chang,et al.  A simulated annealing approach to scheduling a manufacturing cell , 1990 .

[24]  Rasaratnam Logendran,et al.  Group scheduling in flexible flow shops , 2005 .

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

[26]  Rasaratnam Logendran,et al.  Sequence-dependent group scheduling problems in flexible flow shops , 2006 .

[27]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[28]  Jatinder N. D. Gupta,et al.  Heuristics for hybrid flow shops with controllable processing times and assignable due dates , 2002, Comput. Oper. Res..

[29]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[30]  Carlos D. Paternina-Arboleda,et al.  Scheduling jobs on a k-stage flexible flow shop using a TOC-based (bottleneck) procedure , 2004, SIEDS 2004.

[31]  Christos Koulamas,et al.  Flexible flow shop scheduling with uniform parallel machines , 2006, Eur. J. Oper. Res..

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

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

[34]  Brian Fynes,et al.  The effects of design quality on quality performance , 2005 .

[35]  Valerie Botta-Genoulaz,et al.  Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness , 2000 .

[36]  Christos Koulamas,et al.  A note on weighted completion time minimization in a flexible flow shop , 2001, Oper. Res. Lett..

[37]  Ruyan Fu,et al.  The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan , 2008 .