A reduction from stochastic reentrant flow shops to parallel machine scheduling with arrivals yields the first optimality proofs for priority policies on makespan and total completion time, plus an approximation bound for weighted completion time.
Weber , title =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Flow Shop Scheduling with Stochastic Reentry
A reduction from stochastic reentrant flow shops to parallel machine scheduling with arrivals yields the first optimality proofs for priority policies on makespan and total completion time, plus an approximation bound for weighted completion time.