Dynamic set-up rules for hybrid flow shop scheduling with parallel batching machines

An S-stage hybrid (or flexible) flow shop, with sequence-independent uniform set-up times, parallel batching machines with compatible parallel batch families (like in casting or heat treatments in furnaces, chemical or galvanic baths, painting in autoclave, etc.) has been analysed with the purpose of reducing the number of tardy jobs (and the makespan); in Graham’s notation: FPB(m1, m2, …, mS)|p-batch, . Jobs are sorted dynamically (at each new delivery); batches are closed within sliding (or rolling) time windows and processed in parallel by multiple identical machines. Computation experiments have shown the better performance on benchmarks of the two proposed heuristics based on new formulations of the critical ratio (CRsetup) considering the ratio of allowance set-up and processing time in the scheduling horizon, which improves the weighted modified operation due date rule.

[1]  Michele Lanzetta,et al.  Native metaheuristics for non-permutation flowshop scheduling , 2014, J. Intell. Manuf..

[2]  William L. Berry,et al.  Critical Ratio Scheduling: An Experimental Analysis , 1975 .

[3]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[4]  Michael Pinedo,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..

[5]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Sebastián Lozano,et al.  Production and delivery scheduling problem with time windows , 2005, Comput. Ind. Eng..

[9]  Michele Lanzetta,et al.  Nonpermutation flow line scheduling by ant colony optimization , 2013, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[10]  Reha Uzsoy,et al.  Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates , 1997, Ann. Oper. Res..

[11]  Bernd Scholz-Reiter,et al.  Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems , 2013 .

[12]  Muzaffer Kapanoglu,et al.  Learning IF-THEN priority rules for dynamic job shops using genetic algorithms , 2011 .

[13]  David B. Pratt,et al.  The modified critical ratio: towards sequencing with a continuous decision domain , 2005 .

[14]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

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

[16]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[17]  Tullio Tolio,et al.  A Decomposition Method to Support the Configuration / Reconfiguration of Production Systems , 2005 .

[18]  Jatinder N. D. Gupta,et al.  Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups , 2010 .

[19]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

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

[21]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[22]  Michele Lanzetta,et al.  Scheduling flow lines with buffers by ant colony digraph , 2013, Expert Syst. Appl..

[23]  P. Brunn,et al.  Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach , 1999 .

[24]  Michele Lanzetta,et al.  Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: application at a hospital sterilisation plant , 2013 .

[25]  Li-Chen Fu,et al.  Using dispatching rules for job shop scheduling with due date-based objectives , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[26]  Xiaoming Li,et al.  A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness , 2004, J. Sched..

[27]  Michele Lanzetta,et al.  , M . : Heuristics for Scheduling a Two-stage Hybrid Flow Shop with Parallel Batching Machines : an Application on Hospital Sterilization Plant , 2013 .

[28]  Li-Chen Fu,et al.  Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times , 2009, Eur. J. Oper. Res..

[29]  Peter T. Cummings,et al.  Flowshop sequencing with non-permutation schedules , 1991 .

[30]  John W. Fowler,et al.  Semiconductor Manufacturing Scheduling and Dispatching , 2006 .

[31]  C. Liao,et al.  A performance evaluation of permutation vs. non-permutation schedules in a flowshop , 2006 .