On-line two-machine open shop scheduling with time lags
From MaRDI portal
Publication:2654315
DOI10.1016/j.ejor.2009.09.023zbMath1178.90166OpenAlexW4250059264MaRDI QIDQ2654315
Xiandong Zhang, Steef L. van de Velde
Publication date: 15 January 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.09.023
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On the complexity of open shop scheduling with time lags ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Minimizing flowtime for paired tasks ⋮ Two machines flow shop with reentrance and exact time lag ⋮ On-line two-machine job shop scheduling with time lags ⋮ The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
Cites Work
- Unnamed Item
- Tactically delayed versus non-delay scheduling: An experimental investigation
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- On-line scheduling of two-machine open shops where jobs arrive over time
- Fault-tolerant scheduling
- Two-machine open shop scheduling with special transportation times
- Open shop scheduling with delays
- On-line scheduling of small open shops
This page was built for publication: On-line two-machine open shop scheduling with time lags