A sequential genetic programming method to learn forward construction heuristics for order acceptance and scheduling

Order acceptance and scheduling (OAS) is a hard optimisation problem in which both acceptance decisions and scheduling decisions must be considered simultaneously. Designing effective solution methods or heuristics for OAS is not a trivial task, especially to deal with different problem configurations and sizes. This paper proposes a new heuristic framework called forward construction heuristic (FCH) for OAS and develops a new sequential genetic programming (SGPOAS) method for automatic design of FCHs. The key idea of the new GP method is to learn priority rules directly from optimal scheduling decisions at different decision moments and evolve a set of rules for FCHs instead of a single rule as shown in previous studies. The results show that evolved FCHs are significantly better than evolved single priority rules. The evolved FCHs are also competitive with the existing meta-heuristics in the literature and very effective for large problem instances.

[1]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

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

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

[4]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[5]  F. Sibel Salman,et al.  Order acceptance and scheduling decisions in make-to-order systems , 2010 .

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

[7]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

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

[9]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

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

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

[12]  Mengshi Lu,et al.  Integrated order selection and production scheduling under MTO strategy , 2011 .

[13]  Shih-Wei Lin,et al.  Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm , 2013, J. Oper. Res. Soc..

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

[15]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[16]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[17]  Ceyda Oguz,et al.  A tabu search algorithm for order acceptance and scheduling , 2012, Comput. Oper. Res..