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

Authors: J. Krishnaraj; S. Pugazhendhi; Chandrasekharan Rajendran; S. Thiagarajan

Addresses: Department of Mechanical Engineering, MLR Institute of Technology, Hyderabad 500 043, Telangana, India ' Directorate of Distance Education, Annamalai University, Annamalai Nagar 608 002, Tamilnadu, India ' Department of Management Studies, Indian Institute of Technology Madras, Chennai 600 036, Tamilnadu, India ' School of Mechanical Engineering, VIT University, Vellore 632 014, Tamilnadu, India

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.

DOI: 10.1504/IJISE.2019.099188

International Journal of Industrial and Systems Engineering, 2019 Vol.31 No.4, pp.425 - 451

Received: 15 Aug 2016
Accepted: 29 May 2017
Published online: 23 Apr 2019 *

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