Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
From MaRDI portal
Publication:3856410
DOI10.2307/3009386zbMath0422.90040OpenAlexW4232235058MaRDI QIDQ3856410
C. R. Woollam, Shrikant 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
schedulingtraveling salesman problemminimizing makespanno in-process waitingordered flow shop problems
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
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 ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints
This page was built for publication: Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case
