Ordered Flow Shop Problems with no In-Process Waiting: Further Results

DOI10.2307/2581285zbMath0441.90041OpenAlexW4235566026MaRDI QIDQ3883870

C. R. Woollam, Shrikant S. Panwalkar

Publication date: 1980

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581285

zbMATH Keywords

optimal sequencemakespan criterionin-process waitingmean flow time criterionordered flow shop sequencingshortest processing time rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Flowshop scheduling with dominant machines ⋮ On a scheduling problem in a robotized analytical system ⋮ Minimizing makespan in an ordered flow shop with machine-dependent processing times ⋮ A note on makespan minimization in proportionate flow shops ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems

This page was built for publication: Ordered Flow Shop Problems with no In-Process Waiting: Further Results