Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case

DOI10.2307/3009386MaRDI QIDQ3856410zbMATH OpenOpenAlexFDO

Authors C. R. Woollam, S. S. Panwalkar

Publication date 1979

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

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

zbMATH Keywords

minimizing makespanno in-process waitingordered flow shop problemsschedulingtraveling salesman problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of mathematical programming (90C90)

Cited in

(4)

• Reduction of job-shop problems to flow-shop problems with precedence constraints
• On a scheduling problem in a robotized analytical system
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines

This page was built for publication: Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case

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