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

Authors: J. Krishnaraj; S. Thiagarajan

Addresses: Department of Mechanical Engineering, MLR Institute of Technology, Hyderabad 500 043, Telangana, India ' School of Mechanical Engineering, VIT University, Vellore 632 014, Tamilnadu, India

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.

DOI: 10.1504/IJPMB.2020.106143

International Journal of Process Management and Benchmarking, 2020 Vol.10 No.2, pp.261 - 281

Received: 01 Aug 2017
Accepted: 23 Mar 2018
Published online: 01 Apr 2020 *

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