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

Sameer Sharma, Deepak Gupta and Kewal Krishan Nailwal

International Journal of Operational Research, 2017, vol. 29, issue 1, 127-147

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. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=83186 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:29:y:2017:i:1:p:127-147

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().