An upper bound for the inter-exit time of two jobs in an m-machine flow shop

Marcello Urgo () and Massimo Manzini
Additional contact information
Marcello Urgo: Politecnico di Milano
Massimo Manzini: Leonardo S.p.A.

Annals of Operations Research, 2024, vol. 338, issue 1, No 14, 379-405

Abstract: Abstract This paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time, i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines.

Keywords: Flow shop; Scheduling; Inter-exit time (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-05957-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:338:y:2024:i:1:d:10.1007_s10479-024-05957-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-05957-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().