Title: Scheduling jobs on flowshop environment applying simulated annealing algorithm

Authors: R. Rajkumar, P. Shahabudeen

Addresses: Department of Mechanical Engineering, Mepco Schlenk Engineering College, Sivakasi, Tamil Nadu, India. ' Department of Industrial Engineering, Anna University, Chennai, India

Abstract: Simulated Annealing (SA) heuristics have been successfully applied on a variety of complex optimisation problems. This paper investigates the effect of different neighbourhood scheme on the SA process through computational experiments on the permutation flowshop scheduling problem with makespan criterion and proposes an improved SA procedure with a neighbourhood scheme. The test problems are selected from the OR-library and experiment results show that the comparative performances of SA with different neighbourhood schemes and that the proposed SA with a neighbourhood scheme always gives good performance.

Keywords: simulated annealing; flowshop scheduling; makespan; neighbourhood scheme.

DOI: 10.1504/IJSOI.2009.026950

International Journal of Services Operations and Informatics, 2009 Vol.4 No.3, pp.212 - 231

Available online: 09 Jul 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article