Flow shops with reentry: The total weighted completion time objective
Maximilian von Aspern, Felix Buld, Nicklas Klein, Michael Pinedo

TL;DR
This paper studies the scheduling problem in flow shops with reentry, where jobs revisit machines multiple times, aiming to minimize total weighted completion time, and introduces new algorithms and complexity results for this problem.
Contribution
It proves NP-hardness for reentrant flow shops with multiple machines, proposes the LRL and WLRL priority rules, and develops an FPTAS and pseudo-polynomial algorithms for fixed machine counts.
Findings
LRL rule minimizes total unweighted completion time
WLRL rule has a worst-case ratio of about 1.2
FPTAS provides near-optimal solutions efficiently
Abstract
Flow shops are widely 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Supply Chain and Inventory Management
