Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops

J. Krishnaraj, S. Pugazhendhi, Chandrasekharan Rajendran and S. Thiagarajan

International Journal of Industrial and Systems Engineering, 2019, vol. 31, issue 4, 425-451

Abstract: In this paper, the permutation flowshop scheduling problem with the objective of minimising the completion time variance (CTV) of jobs is considered, and a simulated annealing algorithm (SA) and two modified SAs (MSA1 and MSA2) are proposed. In the first phase, the proposed algorithms are used to minimise CTV of jobs without any right shifting of completion times of jobs on the last machine (RSCT). As followed in the literature some times, the RSCT (except that of the last job) is attempted in the second phase, and in the third phase, we convert sequences so as to follow the V-shaped property with respect to processing time of jobs on the last machine, followed by RSCT except that of the last job, so that the makespan and the machine utilisation in the shop floor remain the same. We present an extensive computational evaluation of the existing and the proposed heuristic algorithms.

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

Downloads: (external link)
http://www.inderscience.com/link.php?id=99188 (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:ijisen:v:31:y:2019:i:4:p:425-451

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().