Recoverable Robust Timetables: An Algorithmic Approach on Trees

Abstract : In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the scheduled activities in order to be "prepared" if a delay occurs, and absorb it without the necessity of rescheduling all the activities from scratch. This realizes the concept of designing robust timetables. During the planning phase, one should also consider recovery features that might be applied at runtime if disruptions occur. This leads to the concept of recoverable robust timetables. In this new concept, it is assumed that recovery capabilities are given as input along with the possible disruptions that must be considered. The main objective is the minimization of the overall needed time. The quality of a robust timetable is measured by the price of robustness, i.e., the ratio between the cost of the robust timetable and that of a nonrobust optimal timetable. We show that finding an optimal solution for this problem is NP-hard even though the topology of the network, which models dependencies among activities, is restricted to trees. However, we manage to design a paeudopolynomial time algorithm based on dynamic programming and apply it on both random networks and real case scenarios provided by Italian railways. We evaluate the effect of robustness on the scheduling of the activities and provide the price of robustness with respect to different scenarios. We experimentally show the practical effectiveness and efficiency of the proposed algorithm.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (3), pp.433 - 446. <10.1109/TC.2010.142>
Liste complète des métadonnées


https://hal.inria.fr/hal-00643980
Contributeur : Gianlorenzo D'Angelo <>
Soumis le : mercredi 23 novembre 2011 - 13:12:25
Dernière modification le : mardi 22 mai 2012 - 14:55:23
Document(s) archivé(s) le : vendredi 24 février 2012 - 02:25:39

Fichier

RobustTree.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina Pinotti. Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (3), pp.433 - 446. <10.1109/TC.2010.142>. <hal-00643980>

Partager

Métriques

Consultations de
la notice

279

Téléchargements du document

173