Dynamic Scheduling with Genetic Programming

  • Domagoj Jakobović
  • Leo Budin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3905)


This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine dynamic problem and job shop scheduling with bottleneck estimation.


Genetic Programming Dynamic Schedule Priority Function Schedule Environment Schedule Instance 
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.
    Jones, A., Rabelo, L.C.: Survey of job shop scheduling techniques. Technical report, NISTIR, National Institute of Standards and Technology, Gaithersburg (1998)Google Scholar
  2. 2.
    Walker, S.S., Brennan, R.W., Norrie, D.H.: Holonic job shop scheduling using a multiagent system. IEEE Intelligent Systems 2, 50 (2005)CrossRefGoogle Scholar
  3. 3.
    Dimopoulos, C., Zalzala, A.: A genetic programming heuristic for the one-machine total tardiness problem. In: Proceedings of the Congress on Evolutionary Computation, vol. 3 (1999)Google Scholar
  4. 4.
    Dimopoulos, C., Zalzala, A.M.S.: Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 32(6), 489 (2001)CrossRefMATHGoogle Scholar
  5. 5.
    Adams, T.P.: Creation of simple, deadline, and priority scheduling algorithms using genetic programming. In: Genetic Algorithms and Genetic Programming at Stanford 2002 (2002)Google Scholar
  6. 6.
    Yin, W.J., Liu, M., Wu, C.: Learning single-machine scheduling heuristics subject to machine breakdowns with genetic programming. In: Proceedings of the 2003 Congress on Evolutionary Computation CEC 2003, p. 1050. IEEE Press, Los Alamitos (2003)Google Scholar
  7. 7.
    Atlan, B.L., Polack, J.: Learning distributed reactive strategies by genetic programming for the general job shop problem. In: Proceedings 7th annual Florida Artificial Intelligence Research Symposium, IEEE Press, Los Alamitos (1994)Google Scholar
  8. 8.
    Miyashita, K.: Job-shop scheduling with gp. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), p. 505. Morgan Kaufmann, San Francisco (2000)Google Scholar
  9. 9.
    Cheng, V., Crawford, L., Menon, P.: Air traffic control using genetic search techniques. In: IEEE International Conference on Control Applications. IEEE, Hawai’i (1999)Google Scholar
  10. 10.
    Hansen, J.V.: Genetic search methods in air traffic control. Computers and Operations Research 31(3), 445 (2004)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Pinedo, M.: Offline deterministic scheduling, stochastic scheduling, and online deterministic scheduling: A comparative overview. In: Leung, J.Y.T. (ed.) Handbook of Scheduling, Chapman & Hall/CRC, Boca Raton (2004)Google Scholar
  12. 12.
    Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems. John Wiley & Sons, Inc, Chichester (1993)Google Scholar
  13. 13.
    Mohan, R., Rachamadugu, V., Morton, T.E.: Myopic heuristics for the weighted tardiness problem on identical parallel machines. Technical report, The Robotics Institute, Carnegie-Mellon University (1983)Google Scholar
  14. 14.
    Chang, Y.L., Sueyoshi, T., Sullivan, R.: Ranking dispatching rules by data envelopment analysis in a job shop environment. IIE Transactions 28(8), 631 (1996)CrossRefGoogle Scholar
  15. 15.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Domagoj Jakobović
    • 1
  • Leo Budin
    • 1
  1. 1.Faculty of Electrical Engineering and ComputingUniversity of ZagrebCroatia

Personalised recommendations