A two-phase simulated annealing algorithm to minimise the completion time variance of jobs in flowshops

J. Krishnaraj and S. Thiagarajan

International Journal of Process Management and Benchmarking, 2020, vol. 10, issue 2, 261-281

Abstract: In this paper, simulated annealing (SA) algorithm is employed to solve the flowshop scheduling problem with the objective of minimising the completion time variance (CTV) of jobs. Four variants of the two-phase SA algorithm (SA-I to SA-IV) are proposed to solve flowshop scheduling problem with the objective of minimising the CTV of jobs without considering the right shifting of completion time of jobs on the last machine. The proposed SA algorithms have been tested on 90 benchmark flowshop scheduling problems. The solutions yielded by the proposed SA variants are compared with the best CTV of jobs reported in the literature, and the proposed SA-III is found to perform well in minimising the chosen performance measure (CTV) particularly in medium and large size problems.

Keywords: scheduling; permutation flowshop; simulated annealing algorithm; completion time variance; CTV. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=106143 (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:ijpmbe:v:10:y:2020:i:2:p:261-281

Access Statistics for this article

More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().