Skip to main content
SpringerLink
Log in

A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2012)

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

Included in the following conference series:

Abstract

This paper deals with the problem of scheduling a set of n independent jobs to be processed on m identical parallel machines in order to minimize makespan. This problem is known to be NP-complete. A SA based heuristic is presented to solve this problem. Empirical results with a large number of randomly generated problem instances demonstrate that the proposed method produces solutions that are fairly superior to that of the best-known method in the literature while not affecting its computational effort.

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 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. McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–8 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, T.C.E., Sin, C.C.S.: A state-of-the-art review of parallel-machine scheduling research. Euro. J. Oper. Res. 47, 271–292 (1990)

    Article  Google Scholar 

  3. Lee, W.-C., Wu, C.-C., Chen, P.: A simulated annealing approach to makespan minimization on identical parallel machines. Int. J. Adv. Manuf. Technol. 31, 328–334 (2006)

    Article  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  5. Graham, R.L.: Bounds on multiprocessor timing anomalies. SIAM J. Appl. Math. 17, 416–429 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multi- processor scheduling. SIAM J. Comput. 7, 1–17 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee, C.Y., Massey, J.D.: Multiprocessor scheduling combining LPT and MULTIFIT. Discrete Appl. Math. 20, 233–242 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ghomi, S.M.T., Ghazvini, F.J.: A pairwise interchange algorithm for parallel machine scheduling. Prod. Plan Control 9, 685–689 (1998)

    Article  Google Scholar 

  9. Gupta, J.N.D., Ruiz-Torres, J.: A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod. Plan Control 12, 28–36 (2001)

    Article  Google Scholar 

  10. Osman, I.H., Potts, C.M.: Simulated annealing for permutation flowshop scheduling. Omega 17, 551–557 (1989)

    Article  Google Scholar 

  11. Laha, D., Chakraborty, U.K.: An efficient stochastic hybrid heuristic for flowshop scheduling. Eng. Appl. Artif. Intell. 20, 851–856 (2007)

    Article  Google Scholar 

  12. Low, C.: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Comput. Oper. Res. 32, 2013–2025 (2005)

    Article  MATH  Google Scholar 

  13. Radhakrishnan, S., Ventura, S.: Simulated annealing for parallel machine scheduling problem with earliness-tardiness penalties and sequence-dependent set-up times. Int. J. Prod. Res. 38, 2233–2252 (2000)

    Article  MATH  Google Scholar 

  14. Ruiz-Torres, A.J., Enscore, E.E., Barton, A.A.: Simulated annealing heuristics for the average flow-time and number of tardy jobs bi-criteria identical parallel machine problem. Comput. Ind. Eng. 33, 257–260 (1997)

    Article  Google Scholar 

  15. Behnamian, J., Zandieh, M., Ghomi, S.M.T.: Parallel-machine scheduling problems with sequence-dependent setup times using ACO, SA and VNS hybrid algorithm. Exp. Sys. Appl. 36, 9637–9644 (2009)

    Article  Google Scholar 

  16. Chang, P.Y., Damodaran, P., Melouk, S.: Minimizing makespan on parallel batch processing machines. Int. J. Prod. Res. 42, 4211–4220 (2004)

    Article  Google Scholar 

  17. Kim, S., Choi, H.S., Lee, D.H.: Scheduling algorithms for parallel machines with sequence-dependent set-up and distinct ready times: Minimizing total tardiness. J. Eng. Manuf. 221, 1087–1096 (2007)

    Article  Google Scholar 

  18. Damodaran, P., Velez-Gallego, M.C.: A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Exp. Sys. Appl. 39, 1451–1457 (2012)

    Article  Google Scholar 

  19. Li, K., Shi, Y., Yang, S.-L., Cheng, B.-Y.: Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl. Soft. Comp. J. 11, 5551–5557 (2011)

    Article  Google Scholar 

  20. Li, K., Yang, S.-L., Ma, H.-W.: A simulated annealing approach to minimize the maximum lateness on uniform parallel machines. Math. Comp. Model 53, 854–860 (2011)

    Article  MATH  Google Scholar 

  21. Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Euro. J. Oper. Res. 100, 464–474 (1997)

    Article  MATH  Google Scholar 

  22. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  23. Aarts, E.H.L., Korst, J.H.M.: Simulated annealing and Boltzman machines, Chichester (1989)

    Google Scholar 

  24. Van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing: Theory and applications. Reidel, Dordrecht (1987)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Jadavpur University, Kolkata, India

    Dipak Laha

Authors
  1. Dipak Laha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, Indian Institute of Technology, 110016, Delhi, India

    Bijaya Ketan Panigrahi

  2. Electronics and Communication Sciences Unit, Indian Statistical Institute, 700108, Kolkata, India

    Swagatam Das

  3. School of Electrical and Electronic Engineering, Nanyang Technological University, Block N4, 2b-39, Nanyang Avenue, 639798, Singapore, Singapore

    Ponnuthurai Nagaratnam Suganthan

  4. Department of Electronics and Telecom. Engineering, Institute of Technical Education & Research, Siksha ’O’ Anusandhan University, 751030, Bhubaneswar, Odisha, India

    Pradipta Kumar Nanda

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laha, D. (2012). A Simulated Annealing Heuristic for Minimizing Makespan in Parallel Machine Scheduling. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Nanda, P.K. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2012. Lecture Notes in Computer Science, vol 7677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35380-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35380-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-35380-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation