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

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

Van-Dat Cung, Marie-Laure Espinouse, 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

makespanscenario approachrobust schedulingMIN-MAX regretprocessing time uncertaintyMIN-MAX

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Robust scheduling with budgeted uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• On the computational complexity of (maximum) shift class scheduling
• Robust linear optimization under general norms.
• Mathematical programming formulations for machine scheduling: A survey
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Robust discrete optimization and its applications
• A robustness measure of the configuration of multi-purpose machines
• The Price of Robustness
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Introduction to Stochastic Programming
• Robust Optimization of Large-Scale Systems
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Scheduling
• On the complexity of a class of combinatorial optimization problems with uncertainty