A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
From MaRDI portal
Publication:4294730
DOI10.1287/moor.19.1.68zbMath0821.90066OpenAlexW1981637794MaRDI QIDQ4294730
Publication date: 27 September 1995
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.1.68
polynomial approximationmakespanrelease datesmaximum completion timegreedy heuristictwo-machine flow shop
Related Items (9)
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint ⋮ A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\) ⋮ Polynomial-time approximation schemes for scheduling problems with time lags ⋮ Optimal control of a two-server flow-shop network ⋮ Two-machine flowshop scheduling in a physical examination center ⋮ An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times ⋮ Two-machine flowshop scheduling with availability constraints
This page was built for publication: A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
