Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling

  • Helga Ingimundardottir
  • Thomas Philip Runarsson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6683)


This paper introduces a framework in which dispatching rules for job-shop scheduling problems are discovered by analysing the characteristics of optimal solutions. Training data is created via randomly generated job-shop problem instances and their corresponding optimal solution. Linear classification is applied in order to identify good choices from worse ones, at each dispatching time step, in a supervised learning fashion. The method is purely data-driven, thus less problem specific insights are needed from the human heuristic algorithm designer. Experimental studies show that the learned linear priority dispatching rules outperforms common single priority dispatching rules, with respect to minimum makespan.


Problem Instance Optimal Schedule Schedule Rule Slack Time Partial Schedule 
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.
    Zhang, W., Dietterich, T.G.: A Reinforcement Learning Approach to Job-shop Scheduling. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 1114–1120. Morgan Kaufmann, San Francisco (1995)Google Scholar
  2. 2.
    Tay, J., Ho, N.: Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & Industrial Engineering 54(3), 453–473 (2008)CrossRefGoogle Scholar
  3. 3.
    Li, X., Olafsson, S.: Discovering Dispatching Rules Using Data Mining. Journal of Scheduling 8(6), 515–527 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Malik, A.M., Russell, T., Chase, M., Beek, P.: Learning heuristics for basic block instruction scheduling. Journal of Heuristics 14(6), 549–569 (2007)CrossRefzbMATHGoogle Scholar
  5. 5.
    Garey, M., Johnson, D., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2), 117–129 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Panwalkar, S., Iskander, W.: A Survey of Scheduling Rules. Operations Research 25(1), 45–61 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Russell, T., Malik, A.M., Chase, M., van Beek, P.: Learning Heuristics for the Superblock Instruction Scheduling Problem. IEEE Transactions on Knowledge and Data Engineering 21(10), 1489–1502 (2009)CrossRefGoogle Scholar
  8. 8.
    Burke, E., Petrovic, S., Qu, R.: Case-based heuristic selection for timetabling problems. Journal of Scheduling 9(2), 115–132 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Jayamohan, M.: Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research 157(2), 307–321 (2004)CrossRefzbMATHGoogle Scholar
  10. 10.
    Makhorin, A.: GNU linear programming kit. Moscow Aviation Institute, Moscow, Russia, 38 (May 2009), Software available at
  11. 11.
    Fan, R.e., Wang, X.r., Lin, C.j.: LIBLINEAR: A Library for Large Linear Classification. Corpus 9, 1871–1874 (2008), Software available at zbMATHGoogle Scholar
  12. 12.
    Lin, C.j., Weng, R.C.: Trust Region Newton Method for Large-Scale Logistic Regression. Journal of Machine Learning Research 9, 627–650 (2008)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Helga Ingimundardottir
    • 1
  • Thomas Philip Runarsson
    • 1
  1. 1.School of Engineering and Natural SciencesUniversity of IcelandIceland

Personalised recommendations