Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances

DOI10.1016/j.ins.2011.12.010zbMath1259.90032OpenAlexW2035759778MaRDI QIDQ454883

Anita Schöbel, Serafino Cicerone, Michael Schachtebeck, Gabriele Di Stefano

Publication date: 10 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.12.010

zbMATH Keywords

robustnessoptimization problemstimetablingdynamic algorithmsrecoverydelay management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Related Items

Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling ⋮ Generalized light robustness and the trade-off between robustness and nominal quality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust optimization - a comprehensive survey
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Computing delay resistant railway timetables
• Adjustable robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• A survey of metaheuristic-based techniques for university timetabling problems
• Optimization models for the single delay management problem in public transportation
• Robust Convex Optimization
• Dynamic Algorithms for Recoverable Robustness Problems.
• The Price of Robustness
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Recoverable Robustness in Shunting and Timetabling
• Light Robustness
• Introduction to Stochastic Programming
• Robust Optimization for Empty Repositioning Problems
• Algorithm Theory - SWAT 2004