Creating a Multi-iterative-Priority-Rule for the Job Shop Scheduling Problem with Focus on Tardy Jobs via Genetic Programming

Genetic programming is used to create Priority Rules (PR) for the Job Shop Scheduling Problem with the aim of minimizing the weighted sum of tardy jobs. Four types of structures are used for the PR: Normal PR, Iterative-PR (IPR), Multi-PR (MPR), and Multi-Iterative-PR (MIPR). These are then compared among one another and with classical PR like shortest-processing-time. A modern metaheuristic based on local search using disjunct graphs and critical paths is used to solve the static problem as a benchmark. The results show that all types provide better results than classical PR and that with and without time limit the types from best to worst are: MIPR, MPR, IPR, and PR. The gaps to the metaheuristic are also reported.

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

[2]  Stephan M. Winkler,et al.  Architecture and Design of the HeuristicLab Optimization Environment , 2014 .

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

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

[5]  Dong X. Shaw,et al.  Complexity of the ELSP with general cyclic schedules , 1997 .

[6]  Michael Pinedo,et al.  A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops , 1998 .

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

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

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

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

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

[12]  Yazid Mati,et al.  A general approach for optimizing regular criteria in the job-shop scheduling problem , 2011, Eur. J. Oper. Res..

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

[14]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .