Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
From MaRDI portal
Publication:4658386
DOI10.1057/palgrave.jors.2601025zbMath1131.90357OpenAlexW1999298971MaRDI QIDQ4658386
Piotr Formanowicz, Marie-Laure Espinouse, Bernard Penz
Publication date: 16 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.2601025
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach ⋮ Developing a flexible manufacturing control system considering mixed uncertain predictive maintenance model: a simulation-based optimization approach ⋮ A survey of scheduling problems with no-wait in process ⋮ No-wait two-stage flowshop problem with multi-task flexibility of the first machine ⋮ Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
