Evolving control rules for a dual-constrained job scheduling scenario

Dispatching rules are often used for scheduling in semiconductor manufacturing due to the complexity and stochasticity of the problem. In the past, simulation-based Genetic Programming has been shown to be a powerful tool to automate the time-consuming and expensive process of designing such rules. However, the scheduling problems considered were usually only constrained by the capacity of the machines. In this paper, we extend this idea to dual-constrained flow shop scheduling, with machines and operators for loading and unloading to be scheduled simultaneously. We show empirically on a small test problem with parallel workstations, re-entrant flows and dynamic stochastic job arrival that the approach is able to generate dispatching rules that perform significantly better than benchmark rules from the literature.

[1]  Hoda A. ElMaraghy,et al.  Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms , 2000 .

[2]  Reha Uzsoy,et al.  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach , 2006, J. Sched..

[3]  Bernd Scholz-Reiter,et al.  Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations , 2015, Evolutionary Computation.

[4]  Cheng Wu,et al.  Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[5]  Mark Johnston,et al.  A Computational Study of Representations in Genetic Programming to Evolve Dispatching Rules for the Job Shop Scheduling Problem , 2013, IEEE Transactions on Evolutionary Computation.

[6]  Mengjie Zhang,et al.  Automated Design of Production Scheduling Heuristics: A Review , 2016, IEEE Transactions on Evolutionary Computation.

[7]  Paul R. Drake,et al.  Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms , 2009 .

[8]  Bernd Scholz-Reiter,et al.  Analysis And Comparison Of Dispatching Rule- Based Scheduling In Dual-Resource Constrained Shop-Floor Scenarios , 2009 .

[9]  Mark Johnston,et al.  A coevolution genetic programming method to evolve scheduling policies for dynamic multi-objective job shop scheduling problems , 2012, 2012 IEEE Congress on Evolutionary Computation.

[10]  Bernd Scholz-Reiter,et al.  Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach , 2010, GECCO '10.

[11]  Christopher D. Geiger,et al.  Learning effective dispatching rules for batch processor scheduling , 2008 .

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

[13]  Graham Kendall,et al.  A Classification of Hyper-heuristics Approaches – Revisited , 2017 .

[14]  Bernd Scholz-Reiter,et al.  Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness , 2010, Proceedings of the 2010 Winter Simulation Conference.

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

[16]  Mark Johnston,et al.  Genetic programming for order acceptance and scheduling , 2013, 2013 IEEE Congress on Evolutionary Computation.

[17]  Jürgen Branke,et al.  On Using Surrogates with Genetic Programming , 2015, Evolutionary Computation.

[18]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .