Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach

DOI10.1007/978-3-319-18167-7_30zbMath1370.90118MaRDI QIDQ5357767

Marie-Laure Espinouse, Van-Dat Cung, Widad Naji

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_30

zbMATH Keywords

makespan; scenario approach; robust scheduling; MIN-MAX regret; processing time uncertainty; MIN-MAX

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems