Skip to main content

Genetic Programming Heuristics for Multiple Machine Scheduling

  • Conference paper
Genetic Programming (EuroGP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4445))

Included in the following conference series:

Abstract

In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programming is used to synthesize the priority function which, coupled with an appropriate meta-algorithm for a given environment, forms the priority scheduling heuristic. We show that the procedures derived in this way can perform similarly or better than existing algorithms. Additionally, this approach may be particularly useful for those combinations of scheduling environment and criteria for which there are no adequate scheduling algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Walker, S.S., Brennan, R.W., Norrie, D.H.: Holonic job shop scheduling using a multiagent system. IEEE Intelligent Systems 2, 50 (2005)

    Article  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  5. Adams, T.P.: Creation of simple, deadline, and priority scheduling algorithms using genetic programming. In: Genetic Algorithms and Genetic Programming at Stanford (2002)

    Google Scholar 

  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. CEC2003, p. 1050. IEEE Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  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. 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. Cheng, V., Crawford, L., Menon, P.: Air traffic control using genetic search techniques. In: IEEE International Conference on Control Applications, Hawai’i. IEEE, Los Alamitos (1999)

    Google Scholar 

  10. Hansen, J.V.: Genetic search methods in air traffic control. Computers and Operations Research 31(3), 445 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lee, Y.H., Bhaskaran, K., Pinedo, M.: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29, 45–52 (1997)

    Article  Google Scholar 

  12. Lee, S.M., Asllani, A.A.: Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming. Omega 32(2), 145–153 (2004)

    Article  Google Scholar 

  13. Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems. John Wiley & Sons, Inc., Chichester (1993)

    Google Scholar 

  14. Jakobovic, D., Budin, L.: Dynamic scheduling with genetic programming. In: EuroGP 2006. LNCS, vol. 3905, p. 73. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. 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 

  16. 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 

  17. Feldman, A., Pinedo, M., Chao, X., Leung, J.: Lekin, flexible job shop scheduling system (2003), http://www.stern.nyu.edu/om/software/lekin/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marc Ebner Michael O’Neill Anikó Ekárt Leonardo Vanneschi Anna Isabel Esparcia-Alcázar

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Jakobović, D., Jelenković, L., Budin, L. (2007). Genetic Programming Heuristics for Multiple Machine Scheduling. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds) Genetic Programming. EuroGP 2007. Lecture Notes in Computer Science, vol 4445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71605-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71605-1_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71602-0

  • Online ISBN: 978-3-540-71605-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics