Skip to main content
SpringerLink
Log in

A simulated annealing approach to makespan minimization on identical parallel machines

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper addresses a makespan minimization scheduling problem on identical parallel machines. Several heuristic algorithms have been proposed to tackle the problem. In this paper, a very effective simulated annealing method is proposed to generate the near-optimal solution. Computational results demonstrate that the proposed heuristic is very accurate and that it outperforms the existing methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River, New Jersey

    Google Scholar 

  2. Gupta JND, Ruiz-Torres AJ (2001) A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28–36

    Article  Google Scholar 

  3. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. Freeman, San Francisco, California

    Google Scholar 

  4. Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416–429

    Article  MATH  MathSciNet  Google Scholar 

  5. Coffman EG, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7:1–17

    Article  MATH  MathSciNet  Google Scholar 

  6. Friesen DK (1984) Tighter bounds for the multifit processor scheduling algorithm. SIAM J Comput 13:170–181

    Article  MATH  MathSciNet  Google Scholar 

  7. Yue M (1990) On the exact upper bound for the MULTIFIT processor algorithm. Ann Oper Res 24:233–259

    Article  MATH  MathSciNet  Google Scholar 

  8. Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233–242

    Article  MATH  MathSciNet  Google Scholar 

  9. Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (1996) Scheduling computer and manufacturing systems. Springer, Berlin Heidelberg New York

    Google Scholar 

  10. Riera J, Alcaide D, Sicilia J (1996) Approximate algorithms for the PCmax problem. Topology 4:345–359

    MATH  MathSciNet  Google Scholar 

  11. Fatemi Ghomi SMT, Jolai Ghazvini F (1998) A pairwise interchange algorithm for parallel machine scheduling. Prod Plan Control 9:685–689

    Article  Google Scholar 

  12. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  14. Park MW, Kim YD (1997) Search heuristics for a parallel machine scheduling problem with ready times and due dates. Comput Ind Eng 33:793–796

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  16. Kim DW, Na DG, Chen FF (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot Comput-Int Manuf 19:173–181

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Feng Chia University, Taichung, Taiwan, Republic of China

    Wen-Chiung Lee, Chin-Chia Wu & Peter Chen

Authors
  1. Wen-Chiung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wen-Chiung Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, WC., Wu, CC. & Chen, P. A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol 31, 328–334 (2006). https://doi.org/10.1007/s00170-005-0188-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0188-5

Keywords

Search

Navigation