Recoverable Robust Timetables: An Algorithmic Approach on Trees

DOI10.1109/TC.2010.142zbMath1368.68120OpenAlexW2151598016MaRDI QIDQ5280617

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

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)

Related Items (4)

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

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