The two-machine open shop problem: To fit or not to fit, that is the question
From MaRDI portal
Publication:1811630
DOI10.1016/S0167-6377(03)00018-XzbMath1013.90069OpenAlexW2115457261MaRDI QIDQ1811630
Marjan van den Akker, Hoogeveen, J. A., Gerhard J. Woeginger
Publication date: 17 June 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00018-x
Related Items (3)
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The Open Shop Scheduling Problem ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Cites Work
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- Optimal two- and three-stage production schedules with setup times included
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: The two-machine open shop problem: To fit or not to fit, that is the question
