Genetic programming for job shop scheduling

Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is not a trivial task. In the early stage, scheduling experts rely on their experiences to develop dispatching rules and further improve them through trials-and-errors, sometimes with the help of computer simulations. In recent years, automated design approaches have been applied to develop effective dispatching rules for job shop scheduling (JSS). Genetic programming (GP) is currently the most popular approach for this task. The goal of this chapter is to summarise existing studies in this field to provide an overall picture to interested researchers. Then, we demonstrate some recent ideas to enhance the effectiveness of GP for JSS and discuss interesting research topics for future studies.

[1]  Subramaniam Balakrishnan,et al.  Sequencing jobs on a single machine: A neural network approach , 2000, Eur. J. Oper. Res..

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

[3]  Mark Johnston,et al.  Evolving "less-myopic" scheduling rules for dynamic job shop scheduling with genetic programming , 2014, GECCO.

[4]  Kazuo Miyashita,et al.  Job-shop scheduling with genetic programming , 2000 .

[5]  Mengjie Zhang,et al.  Algebraic simplification of GP programs during evolution , 2006, GECCO.

[6]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

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

[8]  Mario Vanhoucke,et al.  A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions , 2012 .

[9]  Liang Gao,et al.  A GEP-based reactive scheduling policies constructing approach for dynamic flexible job shop scheduling problem with job release dates , 2013, J. Intell. Manuf..

[10]  Sanja Petrovic,et al.  Fuzzy job shop scheduling with lot-sizing , 2008, Ann. Oper. Res..

[11]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[12]  Chandrasekharan Rajendran,et al.  Development and analysis of cost-based dispatching rules for job shop scheduling , 2004, Eur. J. Oper. Res..

[13]  Ali M. S. Zalzala,et al.  Investigating the use of genetic programming for a classic one-machine scheduling problem , 2001 .

[14]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[15]  Li-Chen Fu,et al.  A new paradigm for rule-based scheduling in the wafer probe centre , 2008 .

[16]  Hiroshi Ohta,et al.  A heuristic for job shop scheduling to minimize total weighted tardiness , 2002 .

[17]  Liang Gao,et al.  Evolving scheduling rules with gene expression programming for dynamic single-machine scheduling problems , 2010 .

[18]  Chandrasekharan Rajendran,et al.  Efficient jobshop dispatching rules: Further developments , 2000 .

[19]  Chris N. Potts,et al.  Fifty years of scheduling: a survey of milestones , 2009, J. Oper. Res. Soc..

[20]  Mark Johnston,et al.  A Relaxed Approach to Simplification in Genetic Programming , 2010, EuroGP.

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

[22]  Su Nguyen,et al.  Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming , 2013 .

[23]  Kenneth N. McKay,et al.  Job-Shop Scheduling Theory: What Is Relevant? , 1988 .

[24]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[25]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[26]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[27]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[28]  Vladimir Cretu,et al.  EFFICIENT GENERATION OF NEAR OPTIMAL INITIAL POPULATIONS TO ENHANCE GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING , 2010 .

[29]  Cândida Ferreira,et al.  Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence , 2014, Studies in Computational Intelligence.

[30]  Piotr Jedrzejowicz,et al.  Agent-Based Gene Expression Programming for Solving the RCPSP/max Problem , 2009, ICANNGA.

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

[32]  Mark Johnston,et al.  Automatic Design of Scheduling Policies for Dynamic Multi-objective Job Shop Scheduling via Cooperative Coevolution Genetic Programming , 2014, IEEE Transactions on Evolutionary Computation.

[33]  Chandrasekharan Rajendran,et al.  New dispatching rules for shop scheduling: A step forward , 2000 .

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

[35]  N. Jawahar,et al.  A multiobjective genetic algorithm for job shop scheduling , 2001 .

[36]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[37]  Jing Wang,et al.  Swarm Intelligence in Cellular Robotic Systems , 1993 .

[38]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

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

[40]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[41]  Mark Johnston,et al.  Dynamic Multi-objective Job Shop Scheduling: A Genetic Programming Approach , 2013, Automated Scheduling and Planning.

[42]  Mark Johnston,et al.  Learning Reusable Initial Solutions for Multi-objective Order Acceptance and Scheduling Problems with Genetic Programming , 2013, EuroGP.

[43]  S. Kreipl.  A large step random walk for minimizing total weighted tardiness in a job shop , 2000 .

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

[45]  Graham Kendall,et al.  Exploring Hyper-heuristic Methodologies with Genetic Programming , 2009 .

[46]  Thomas Philip Runarsson,et al.  Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling , 2011, LION.

[47]  Sanja Petrovic,et al.  SURVEY OF DYNAMIC SCHEDULING IN MANUFACTURING SYSTEMS , 2006 .

[48]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

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

[50]  Xiaogang Wang,et al.  Discover Scheduling Strategies with Gene Expression Programming for Dynamic Flexible Job Shop Scheduling Problem , 2012, ICSI.

[51]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[52]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[53]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[54]  Domagoj Jakobovic,et al.  Evolving priority scheduling heuristics with genetic programming , 2012, Appl. Soft Comput..

[55]  Domagoj Jakobovic,et al.  Dynamic Scheduling with Genetic Programming , 2006, EuroGP.

[56]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .

[57]  Mark Johnston,et al.  Learning iterative dispatching rules for job shop scheduling with genetic programming , 2013, The International Journal of Advanced Manufacturing Technology.