Title: Permutation flowshops in group scheduling with sequence-dependent setup times

Authors: B. Naderi; Nasser Salmasi

Addresses: Young Researchers Club, Qazvin Branch, Islamic Azad University, Qazvin, Iran. ' Department of Industrial Engineering, Sharif University of Technology, P.O. Box 11365-8639, Tehran, Iran

Abstract: This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|ΣCJ). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the proposed models are significantly reduced. One of the proposed mathematical models is so effective that even medium-sized instances (problems up to 60 jobs in all groups) are solved to optimality in a reasonable amount of time. Moreover, a metaheuristic hybridising genetic and simulated annealing algorithm, called GSA, is proposed to solve the problems heuristically. All the results and analyses show the high performance of the proposed mathematical models as well as the proposed metaheuristic algorithm compared to the available ones in literature. [Received 11 February 2010; Revised 24 May 2010; Accepted 30 September 2010]

Keywords: sequence-dependent setup times; flow shop scheduling; mixed integer linear programming; MILP; hybrid metaheuristics; group scheduling; permutation flow shops; genetic algorithms; simulated annealing; mathematical modelling.

DOI: 10.1504/EJIE.2012.045604

European Journal of Industrial Engineering, 2012 Vol.6 No.2, pp.177 - 198

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 23 Feb 2012 *

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