Simulated annealing algorithms to minimise the completion time variance of jobs in permutation flowshops. (10th April 2019)

• Record Type: Journal Article
• Authors: Krishnaraj, J.; Pugazhendhi, S.; Rajendran, Chandrasekharan; Thiagarajan, S.
• Is Part Of: International journal of industrial and systems engineering. Volume 31:Number 4(2019)
• Page Start: 425
• Page End: 451
• Publication Date: 2019-04-10
• Subjects: scheduling -- permutation flowshop -- simulated annealing algorithm -- completion time variance -- CTV; Systems engineering -- Periodicals; Industrial engineering -- Periodicals; 620.001171
• Languages: English
• ISSNs: 1748-5037

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.