Skip to main content
SpringerLink
Log in

Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem

  • Conference paper
Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5559))

  • 1453 Accesses

Abstract

Influence of the instance size on the efficiency of metaheuristic algorithms for the parallel machine job scheduling with earliness and tardiness penalties problem (PMJS_E/T) has been considered since their emergence. Such size is understood as the number of jobs which need to be scheduled and the number of available machines, capable of their execution. Investigations show that the proper selection of a metaheuristic for a given instance becomes an important issue leading to noticeable improve of quality. This paper tries to determine that dependence and suggests some policy on the selection.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bazyluk, M., Koszalka, L., Burnham, K.: Using heuristic algorithms for parallel machines job scheduling problem. Computer Systems Engineering, 9–29 (2008)

    Google Scholar 

  2. Bullnheimer, B., Hartl, R., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Oper. Research 89, 319–328 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cao, D., Chen, M., Wan, G.: Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comp. & Oper. Research 32, 1995–2012 (2005)

    Article  MATH  Google Scholar 

  4. Davis, L.: Handbook of genetic algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  5. Dorigo, M., Gambardella, L.: Ant colonies for the travelling salesman problem. BioSystems 43, 73–81 (1997)

    Article  Google Scholar 

  6. Garey, M., Tarjan, R.: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330–348 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liao, C., Juan, H.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comp. & Oper. Research 34, 1899–1909 (2007)

    Article  MATH  Google Scholar 

  8. Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. Knowledge and Data Engineering 11, 769–778 (1999)

    Article  Google Scholar 

  9. Middendorf, M., Reischle, F., Schmeck, H.: Multi colony ant algorithms. Journal of Heuristics 8, 305–320 (2002)

    Article  MATH  Google Scholar 

  10. Sivrikaya-Serifoglu, F., Ulusoy, G.: Parallel machine scheduling with earliness and tardiness penalties. Computers & Oper. Research 26, 773–787 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sun, H., Wang, G.: Parallel machine earliness and tardiness scheduling with proportional weights. Computers & Operations Research 30, 801–808 (2003)

    Article  MATH  Google Scholar 

  12. Yano, C., Kim, Y.: Algorithm for a class of single machine weighted tardiness and earliness problems. European Journal of Operational Research 52, 167–178 (1991)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Computer Systems and Networks, Wroclaw University of Technology, Wyb. Wyspianskiego 27, 50-370, Wroclaw, Poland

    Marcin Bazyluk & Leszek Koszalka

Authors
  1. Marcin Bazyluk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leszek Koszalka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Systems Science, Stockholm University, Forum 100, 164 40, Kista, Sweden

    Anne Håkansson

  2. Institute of Informatics, Wroclaw University of Technology, Str. Janiszweskiego 11/17, 50-370, Wroclaw, Poland

    Ngoc Thanh Nguyen

  3. Department of Computer Science, Franklin University, 201 South Grant Ave., 43215, Columbus, Ohio, USA

    Ronald L. Hartung

  4. School of Environment and Technology, Centre for SMART Systems, University of Brighton, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  5. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, SA, 5095, Mawson Lakes, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bazyluk, M., Koszalka, L. (2009). Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01665-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01664-6

  • Online ISBN: 978-3-642-01665-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation