Determining operations affected by delay in predictive train timetables
From MaRDI portal
Publication:336779
DOI10.1016/j.cor.2013.08.011zbMath1348.90244OpenAlexW2033181859MaRDI QIDQ336779
Robert L. Burdett, Erhan Kozan
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/61861/2/61861.pdf
Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)
Related Items
An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems ⋮ Determining operations affected by delay in predictive train timetables ⋮ Optimal allocation of buffer times to increase train schedule robustness ⋮ A new constraint programming approach for optimising a coal rail system
Cites Work
- Determining operations affected by delay in predictive train timetables
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- The train driver recovery problem-a set partitioning based model and solution method
- Computing delay resistant railway timetables
- Algorithms for transitive closure
- Nominal and robust train timetabling problems
- A sequencing approach for creating new train timetables
- A branch and bound algorithm for scheduling trains in a railway network
- A disjunctive graph model and framework for constructing new train schedules
- Simultaneous disruption recovery of a train timetable and crew roster in real time
- Scheduling Trains on Parallel Lines with Crossover Points
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
This page was built for publication: Determining operations affected by delay in predictive train timetables
