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

DOI10.2307/2581285MaRDI QIDQ3883870zbMATH OpenOpenAlexFDO

Authors C. R. Woollam, S. 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

in-process waitingmakespan criterionmean flow time criterionoptimal sequenceordered flow shop sequencingshortest processing time rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883870)