Recoverable Robust Timetables: An Algorithmic Approach on Trees

DOI10.1109/TC.2010.142MaRDI QIDQ5280617zbMATH OpenOpenAlexFDO

Authors Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2010.142

Mathematics Subject Classification ID

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

Cited in

(5)

• Recoverable Robustness in Shunting and Timetabling
• Optimal allocation of buffer times to increase train schedule robustness
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Dominance-based linear formulation for the anchor-robust project scheduling problem

This page was built for publication: Recoverable Robust Timetables: An Algorithmic Approach on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280617)