Istituto di Scienza e Tecnologie dell'Informazione     
D'Angelo G., Di Stefano G., Navarra A., Pinotti M. C. Recoverable robust timetables: an algorithmic approach on trees. In: COCOA 2009 - Combinatorial Optimization and Applications. Third International Conference (Huangshan, China, 10-12 giugno 2009). Proceedings, pp. 451 - 462. (Lecture Notes in Computer Science, vol. 5573). Springer, 2009.
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 re-scheduling 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 non-robust 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 pseudo-polynomial 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.
URL: http://www.springerlink.com/content/l0781v681820/?sortorder=asc&p_o=40
DOI: 10.1007/978-3-642-02026-1_43
Subject Reliability
Time Tabling
Dynamic Programming
G.2.2 Graph Theory
G.2 Discrete Mathematics
G.0 Mathematics of Computing. General
D.4.8 Simulation
D.4 Operating Systems

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional