Title: Bi-criteria multistage flow shop scheduling with sequence-dependent setup times

Authors: Sameer Sharma; Deepak Gupta; Kewal Krishan Nailwal

Addresses: Department of Mathematics, D.A.V. College, Jalandhar, Punjab, India ' Department of Mathematics, M.M. University, Mullana, Ambala, Haryana, India ' Department of Mathematics, A.P.J. College of Fine Arts, Jalandhar, Punjab, India

Abstract: Flow shop scheduling with sequence-dependent setup time is the most complicated case of scheduling of jobs. The operational cost of machines is related to the setup time required for processing of jobs on different machines. To express the randomness probabilities are associated with processing times of different attributes on given machines. The objective is to schedule n-jobs on m-machines to minimise operational cost of machines subject to minimum total elapsed time of jobs in a flow shop whenever the setup times on machines are sequence-dependent. As the problem is NP-hard, a heuristic algorithm is proposed to find the latest time so as to reduce operating time and hence the operational cost with minimum makespan. A numerical example is also given to substantiate the algorithm.

Keywords: multistage scheduling; flow shop scheduling; total elapsed time; sequence-dependent setup times; SDST; processing time; operational cost; operating time; heuristics.

DOI: 10.1504/IJOR.2017.083186

International Journal of Operational Research, 2017 Vol.29 No.1, pp.127 - 147

Received: 22 Apr 2015
Accepted: 12 Jun 2015

Published online: 22 Mar 2017 *

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