Abstract
An interesting practical problem is the single-track train scheduling problem which can be considered a job shop scheduling problem, namely since the sequence of sections is fixed for a train route, it corresponds to fixed machine routes (technological orders) in a job shop scheduling problem. However, for a train scheduling problem, typically some additional constraints such as blocking, sidings, stations with parallel tracks, deadlocks, train length, or headways, etc. have to be considered. The job shop problem has been well investigated in the literature and belongs to the hardest problems in scheduling theory. In this mini-review, some results in this area are discussed, where the main focus is on results that the author has obtained with his collaborators and Ph.D. students during the last decade.
Publisher
Peertechz Publications Private Limited
Reference17 articles.
1. 1. Szpigel B. Optimal Train Scheduling on a Single Line Railway. Operations Research. 1973; 72: 344-351.
2. A Survey of Optimization Models on Train Routing and Scheduling;Cordeau;Transportation Science,1998
3. 3. Lusby RM, Larsen J, Ehrgott M, Ryan D. Railway Track Allocation: Models and Methods, Operations Research Spectrum. 2011; 33(4):843-883.
4. 4. Sotskov Y, Gholami O. Shifting Bottleneck Algorithm for Train Scheduling in a Single-Track Railway, Proccedings of the 14th IFAC Symposium on Information Control Problems, Part 1, Bucharest / Romania. 2012; 87- 92.
5. 5. Gholami O, Sotskov YN, Werner F. Job-Shop Scheduling with Objectives Appropriate for Train Scheduling in a Single-Track Railway, Proceedings of 2nd International Conference on Simulation and Modelling, Technologies and Applications - SIMULTECH 2012, Rome / Italy, 28 - 31 July 2012: 425-430.