Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints

DOI10.1007/s10951-011-0257-6zbMath1280.90028OpenAlexW2006948695MaRDI QIDQ2434297

Alexis Aubry, Mireille Jacomino, André Rossi, Marie-Laure Espinouse

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0257-6

zbMATH Keywords

robustnessqualification managementdemand uncertaintiesparallel multi-purpose machinesscheduling in uncertain environmentssetup cost constraints

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• The computational complexity of the relative robust shortest path problem with interval data
• Robustness in operational research and decision aiding: a multi-faceted issue
• On the calculation of the stability radius of an optimal or an approximate schedule
• Robust discrete optimization and its applications
• Complexity of scheduling problems with multi-purpose machines
• Robust solutions of linear programming problems contaminated with uncertain data
• A fast algorithm for building lattices
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
• A survey of scheduling problems with setup times or costs
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
• The robust shortest path problem with interval data via Benders decomposition
• A robustness measure of the configuration of multi-purpose machines
• The Price of Robustness
• Robust solutions and methods in decision-aid
• Sensitivity analysis for scheduling problems