The robust cyclic job shop problem
From MaRDI portal
Publication:6087479
DOI10.1016/j.ejor.2023.07.042OpenAlexW4281683360MaRDI QIDQ6087479
Idir Hamaz, Sonia Cafieri, Laurent Houssin
Publication date: 15 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.07.042
Cites Work
- Unnamed Item
- Robust optimization for the cyclic hoist scheduling problem
- A robust basic cyclic scheduling problem
- A general model for cyclic machine scheduling problems
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- Adjustable robust solutions of uncertain linear programs
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- The Price of Robustness
- Cyclic Schedules for Job Shops with Identical Jobs
This page was built for publication: The robust cyclic job shop problem