Batch versus cyclic scheduling of flexible flow shops by mixed-integer programming

New mixed-integer programming models are proposed for deterministic batch or cyclic scheduling in flow shops with parallel machines and finite in-process buffers. Models for scheduling with all machines continuously available for processing throughout the entire scheduling horizon as well as for scheduling with an arbitrary pattern of machine availability due to pre-scheduled downtime events are provided. Numerical examples modelled after real-world flexible flow shop scheduling in electronics manufacturing are presented, and to compare the batch and cyclic schedules with continuous or with limited machine availability, results of computational experiments are reported.

[1]  Mostafa Zandieh,et al.  An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[2]  Oliver Braun,et al.  Stability of Johnson's schedule with respect to limited machine availability , 2002 .

[3]  Eric Sanlaville,et al.  Machine scheduling with availability constraints , 1998, Acta Informatica.

[4]  Hong Wang,et al.  Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions , 2005, Expert Syst. J. Knowl. Eng..

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

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

[7]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

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

[9]  Norbert Trautmann,et al.  A cyclic approach to large-scale short-term planning in chemical batch production , 2009, J. Sched..

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

[11]  S. Karabati,et al.  Cyclic scheduling in flow lines : modeling observations, effective heuristics and a cycle time minimization procedure , 1996 .

[12]  T. C. Edwin Cheng,et al.  Complexity of cyclic scheduling problems: A state-of-the-art survey , 2010, Comput. Ind. Eng..

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

[14]  Heinrich Kuhn,et al.  A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..

[15]  Melih Özlen,et al.  Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs , 2010 .

[16]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[17]  Selcuk Karabati,et al.  Cyclic scheduling in synchronous production lines , 1999 .

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

[19]  Pengyu Yan,et al.  A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows , 2010 .

[20]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling surface mount technology lines , 2001 .

[21]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

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

[23]  Jean-Charles Billaut,et al.  Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art , 1999, RAIRO Oper. Res..

[24]  Augusto Q. Novais,et al.  Optimal design and retrofit of batch plants with a periodic mode of operation , 2005, Comput. Chem. Eng..

[25]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[26]  Xiaoqiang Cai,et al.  Cyclic job scheduling in paced assembly lines with cross-trained workers , 2007 .

[27]  Zhen Zhou,et al.  Multi-degree cyclic hoist scheduling with time window constraints , 2011 .

[28]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[29]  Chris N. Potts,et al.  Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

[30]  Tadeusz Sawik,et al.  Optimal versus heuristic scheduling of surface mount technology lines , 2004 .