Title: Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop

Authors: Fariborz Jolai; Seyed Morteza Goldansaz; Amir Hossein Zahedi-Anaraki

Addresses: Department of Industrial Engineering, College of Engineering, University of Tehran, North Kargar St., Tehran 14395-515, Iran ' Department of Industrial Engineering, College of Engineering, University of Tehran, North Kargar St., Tehran 14395-515, Iran ' Department of Industrial Engineering, College of Engineering, University of Tehran, North Kargar St., Tehran 14395-515, Iran

Abstract: This paper presents an imperialist competitive algorithm (ICA) and a simulated annealing (SA) algorithm in a non-preemptive open shop scheduling problem with job dependent setup times and sequence dependent transportation times to minimise the makespan (total completion time). The parameters of the algorithms are tuned by the response surface methodology (RSM). Based on classic approach, the scheduling problems are classified into small, medium and large sized problems. To evaluate the performance of the proposed ICA, its results are compared with the optimum ones obtained by GAMS for the small sized instances. Moreover, for the medium to large sized instances, the obtained solutions by the ICA are compared with the solutions of the effective method - SA algorithm - and the results are analysed.

Keywords: open shop scheduling; makespan minimisation; imperialist competitive algorithm; ICA; simulated annealing; RSM; response surface methodology.

DOI: 10.1504/IJOR.2013.054436

International Journal of Operational Research, 2013 Vol.17 No.3, pp.275 - 294

Received: 11 Jan 2012
Accepted: 16 May 2012
Published online: 29 Jul 2014 *

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