A simulated annealing approach to makespan minimization on identical parallel machines
- First Online:
- Cite this article as:
- Lee, WC., Wu, CC. & Chen, P. Int J Adv Manuf Technol (2006) 31: 328. doi:10.1007/s00170-005-0188-5
- 223 Downloads
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.