Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding
- 12 March 2018
- journal article
- research article
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 79 (3), 506-523
- https://doi.org/10.1134/s0005117918030098
Abstract
The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial time using the method of dynamic programming. Based on this result, the paper also presents a polynomial-time algorithm minimising the weighted number of late trains.Keywords
This publication has 7 references indexed in Scilit:
- Two-directional traffic scheduling problem solution for a single-track railway with sidingAutomation and Remote Control, 2016
- Two-Station Single Track Scheduling Problem**The work was supported by grants: RFBR 13-01-12108, 15-07-07489, 15-07-03141, DAAD A/14/00328.IFAC-PapersOnLine, 2016
- Two-station single-track railway scheduling problem with trains of equal speedComputers & Industrial Engineering, 2015
- Railway track allocation: models and methodsOR Spectrum, 2009
- Scheduling AlgorithmsPublished by Springer Science and Business Media LLC ,2001
- Effective iterative algorithms in scheduling theoryCybernetics and Systems Analysis, 1985
- Two-Way Traffic on a Single Line of RailwayOperations Research, 1966