Flow shops with reentry: The total weighted completion time objective

Maximilian von Aspern (), Felix Buld (), Nicklas Klein () and Michael Pinedo ()
Additional contact information
Maximilian von Aspern: Technical University of Munich
Felix Buld: Technical University of Munich
Nicklas Klein: University of Bern
Michael Pinedo: New York University

Journal of Scheduling, 2025, vol. 28, issue 6, No 3, 585-600

Abstract: Abstract Flow shops are well-studied machine environments in which all jobs must visit all machines in the same order. While conventional flow shops assume that each job traverses the shop only once, many industrial environments require jobs to loop through the shop multiple times before completion. This means that after traversing the shop and completing its processing on the last machine, a job must return to the first machine and traverse the shop again until it has completed all its required loops. Such a setting, referred to as a flow shop with reentry, has numerous applications in industry, e.g., semiconductor manufacturing. The planning problem is to schedule all loops of all jobs while minimizing the total weighted completion time. In this paper, we consider reentrant flow shops with unit processing times. We show that this problem is strongly NP-hard if the number of machines is part of the input. We propose the Least Remaining Loops First (LRL) priority rule and show that it minimizes the total unweighted completion time. Then, we analyze the Weighted Least Remaining Loops First (WLRL) priority rule and show that it has a worst-case performance ratio of $$(1+\sqrt{2})/2\approx 1.207$$ ( 1 + 2 ) / 2 ≈ 1.207 . Additionally, we present a fully polynomial-time approximation scheme (FPTAS) and a pseudo-polynomial-time algorithm if the number of machines in the flow shop is fixed.

Keywords: Machine Scheduling; Flow Shop Scheduling; Job Reentry; Priority Rules (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-025-00847-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:jsched:v:28:y:2025:i:6:d:10.1007_s10951-025-00847-y

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

DOI: 10.1007/s10951-025-00847-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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