A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
From MaRDI portal
Publication:4656745
DOI10.1057/palgrave.jors.2601421zbMath1139.90369OpenAlexW2077749807MaRDI QIDQ4656745
T. Lorigeon, Jean-Charles Billaut, Jean-Louis Bouquard
Publication date: 14 March 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601421
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (5)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ Optimising lot sizing and order scheduling with non-linear production rates ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Mathematical model for cyclic scheduling with work-in-process minimization ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Uses Software
This page was built for publication: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
