A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules

Designing effective dispatching rules for production systems is a difficult and time-consuming task if it is done manually. In the last decade, the growth of computing power, advanced machine learning, and optimisation techniques has made the automated design of dispatching rules possible and automatically discovered rules are competitive or outperform existing rules developed by researchers. Genetic programming is one of the most popular approaches to discovering dispatching rules in the literature, especially for complex production systems. However, the large heuristic search space may restrict genetic programming from finding near optimal dispatching rules. This article develops a new hybrid genetic programming algorithm for dynamic job shop scheduling based on a new representation, a new local search heuristic, and efficient fitness evaluators. Experiments show that the new method is effective regarding the quality of evolved rules. Moreover, evolved rules are also significantly smaller and contain more relevant attributes.

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

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

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

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

[5]  Hong Zhou,et al.  Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm , 2009, Eur. J. Oper. Res..

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

[7]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

[9]  Gary R. Weckman,et al.  A neural network job-shop scheduler , 2008, J. Intell. Manuf..

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

[11]  Mehmet Emin Aydin,et al.  A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application , 2004, J. Intell. Manuf..

[12]  G. Von.  Stumbling blocks of PPC: Towards the holistic configuration of PPC systems , 2005 .

[13]  Sonja Stork,et al.  Artificial Cognition in Production Systems , 2011, IEEE Transactions on Automation Science and Engineering.

[14]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

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

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

[17]  Martin Land,et al.  Workload control in job shops, grasping the tap , 2004 .

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

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

[20]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[21]  Fuminori Oba,et al.  A robust scheduling rule using a Neural Network in dynamically changing job-shop environments , 2008, Int. J. Manuf. Technol. Manag..

[22]  Mark Johnston,et al.  Automatic Programming via Iterated Local Search for Dynamic Job Shop Scheduling , 2015, IEEE Transactions on Cybernetics.

[23]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[24]  Gabriela Ochoa,et al.  On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming , 2011, J. Oper. Res. Soc..

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

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

[27]  Gang Chen,et al.  Genetic Programming Based Hyper-heuristics for Dynamic Job Shop Scheduling: Cooperative Coevolutionary Approaches , 2016, EuroGP.

[28]  Yi Mei,et al.  Feature Selection in Evolving Job Shop Dispatching Rules with Genetic Programming , 2016, GECCO.

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

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

[31]  Domagoj Jakobovic,et al.  Genetic Programming Heuristics for Multiple Machine Scheduling , 2007, EuroGP.

[32]  Domagoj Jakobovic,et al.  Adaptive scheduling on unrelated machines with genetic programming , 2016, Appl. Soft Comput..

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

[34]  Rachel Hunt.  Evolving Dispatching Rules with Greater Understandability for Dynamic Job Shop Scheduling , 2015 .

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

[36]  Mark Johnston,et al.  Selection Schemes in Surrogate-Assisted Genetic Programming for Job Shop Scheduling , 2014, SEAL.

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

[38]  Graham Kendall,et al.  Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one , 2007, GECCO '07.

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

[40]  Yi Mei,et al.  Genetic programming for production scheduling: a survey with a unified framework , 2017, Complex & Intelligent Systems.

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

[42]  Yi Mei,et al.  An Efficient Feature Selection Algorithm for Evolving Job Shop Scheduling Rules With Genetic Programming , 2017, IEEE Transactions on Emerging Topics in Computational Intelligence.

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

[44]  Mengjie Zhang,et al.  Surrogate-Assisted Genetic Programming With Simplified Models for Automated Design of Dispatching Rules , 2017, IEEE Transactions on Cybernetics.

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

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

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

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

[49]  Sigurdur Olafsson,et al.  Learning effective new single machine dispatching rules from optimal scheduling data , 2010 .

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

[51]  Xiaonan Li,et al.  Discovering Dispatching Rules Using Data Mining , 2005, J. Sched..

[52]  Gang Chen,et al.  Parallel Multi-objective Job Shop Scheduling Using Genetic Programming , 2016, ACALCI.

[53]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

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

[55]  Emma Hart,et al.  A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling , 2016, Evolutionary Computation.

[56]  Yeou-Ren Shiue,et al.  Data-mining-based dynamic dispatching rule selection mechanism for shop floor control systems using a support vector machine approach , 2009 .

[57]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[58]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

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

[60]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

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

[62]  Mark Johnston,et al.  Genetic programming for job shop scheduling , 2018, Studies in Computational Intelligence.

[63]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

[64]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .