Evolving Stochastic Dispatching Rules for Order Acceptance and Scheduling via Genetic Programming

  • John Park
  • Su Nguyen
  • Mark Johnston
  • Mengjie Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8272)


This paper focuses on Order Acceptance and Scheduling (OAS) problems in make-to-order manufacturing systems, which handle both acceptance and sequencing decisions simultaneously to maximise the total revenue. Since OAS is a NP-hard problem, several heuristics and meta-heuristics have been proposed to find near-optimal solutions in reasonable computational times. However, previous approaches still have trouble dealing with complex cases in OAS and they often need to be manually customised to handle specific OAS problems. Developing effective and efficient heuristics for OAS is a difficult task. In order to facilitate the development process, this paper proposes a new genetic programming (GP) method to automatically generate dispatching rules to solve OAS problems. To improve the effectiveness of evolved rules, the proposed GP method incorporates stochastic behaviours into dispatching rules to help explore multiple potential solutions effectively. The experimental results show that evolved stochastic dispatching rules (SDRs) can outperform the tabu search heuristic especially customized for OAS. In addition, the evolved SDRs also show better results as compared to rules evolved by the simple GP method.


Genetic Programming Tabu Search Total Revenue Training Instance Customer Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burke, E., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper-heuristics: A survey of the state of the art. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747 (2010)Google Scholar
  2. 2.
    Cesaret, B., Oğuz, C., Salman, F.S.: A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research 39(6), 1197–1205 (2012)CrossRefGoogle Scholar
  3. 3.
    Dimopoulos, C., Zalzala, A.: Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 32(6), 489–498 (2001)CrossRefzbMATHGoogle Scholar
  4. 4.
    Geiger, C.D., Uzsoy, R.: Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research 46(6), 1431–1454 (2008)CrossRefzbMATHGoogle Scholar
  5. 5.
    Geiger, C.D., Uzsoy, R., Aytug, H.: Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Scheduling 9(1), 7–34 (2006)CrossRefzbMATHGoogle Scholar
  6. 6.
    Ghosh, J.B.: Job selection in a heavily loaded shop. Computers & Operations Research 24(2), 141–145 (1997)CrossRefzbMATHGoogle Scholar
  7. 7.
    Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios: A genetic programming approach. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 257–264 (2010)Google Scholar
  8. 8.
    Jakobović, D., Budin, L.: Dynamic scheduling with genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 73–84. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Luke, S.: Essentials of Metaheuristics. Lulu (2009)Google Scholar
  10. 10.
    Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming. In: Krawiec, K., Moraglio, A., Hu, T., Etaner-Uyar, A.Ş., Hu, B. (eds.) EuroGP 2013. LNCS, vol. 7831, pp. 157–168. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. 11.
    Oğuz, C., Salman, F.S., Yalin, Z.B.: Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics 125(1), 200–211 (2010)CrossRefGoogle Scholar
  12. 12.
    Park, J., Nguyen, S., Zhang, M., Johnston, M.: Genetic programming for order acceptance and scheduling. In: IEEE Congress on Evolutionary Computation, pp. 1005–1012 (to appear, 2013)Google Scholar
  13. 13.
    Rom, W.O., Slotnick, S.A.: Order acceptance using genetic algorithms. Computers & Operations Research 36(6), 1758–1767 (2009)CrossRefzbMATHGoogle Scholar
  14. 14.
    Roundy, R., Chen, D., Chen, P., Cakanyildirim, M., Freimer, M.B., Melkonian, V.: Capacity-driven acceptance of customer orders for a multi-stage batch manufacturing system: models and algorithms. IIE Transactions 37(12), 1093–1105 (2005)CrossRefGoogle Scholar
  15. 15.
    Slotnick, S.A.: Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research 212(1), 1–11 (2011)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Slotnick, S.A., Morton, T.E.: Order acceptance with weighted tardiness. Computers & Operations Research 34(10), 3029–3042 (2007)CrossRefzbMATHGoogle Scholar
  17. 17.
    Wester, F.A.W., Wijngaard, J., Zijm, W.R.M.: Order acceptance strategies in a production-to-order environment with setup times and due-dates. International Journal of Production Research 30(6), 1313–1326 (1992)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • John Park
    • 1
  • Su Nguyen
    • 1
  • Mark Johnston
    • 1
  • Mengjie Zhang
    • 1
  1. 1.Evolutionary Computation Research GroupVictoria University of WellingtonWellingtonNew Zealand

Personalised recommendations