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

Fariborz Jolai, Seyed Morteza Goldansaz and Amir Hossein Zahedi-Anaraki

International Journal of Operational Research, 2013, vol. 17, issue 3, 275-294

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. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=54436 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:17:y:2013:i:3:p:275-294

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().