Shifting bottleneck algorithm for train scheduling in a single-track railway
- 1 May 2012
- journal article
- Published by Elsevier BV in IFAC Proceedings Volumes
- Vol. 45 (6), 87-92
- https://doi.org/10.3182/20120523-3-ro-2023.00374
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- A disjunctive graph model and framework for constructing new train schedulesEuropean Journal of Operational Research, 2010
- Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower boundsTransportation Research Part B: Methodological, 2007
- Heuristic approach to train reschedulingYugoslav Journal of Operations Research, 2007
- Scheduling trains on a railway network using a discrete event model of railway trafficTransportation Research Part B: Methodological, 2004
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- Greedy heuristics for rapid scheduling of trains on a single trackIIE Transactions, 1998
- Optimal scheduling of trains on a single line trackTransportation Research Part B: Methodological, 1996
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- NP-hardness of shop-scheduling problems with three jobsDiscrete Applied Mathematics, 1995
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994