Complexity, bounds and dynamic programming algorithms for single track train scheduling
In this work we consider the single track train scheduling problem. The problem consists of scheduling a set of trains from opposite sides along a single track. The track has intermediate stations and the trains are only allowed to pass each other at those stations. Traversal times of the trains on the blocks between the stations only depend on the block lengths but not on the train. This problem is a special case of minimizing the makespan in job shop scheduling with two counter routes and no preemption. We develop a lower bound on the makespan of the train scheduling problem which provides us with an easy solution method in some special cases. Additionally, we prove that for a fixed number of blocks the problem can be solved in pseudo-polynomial time.
|Keywords||Complexity analysis, Counter routes, Machine scheduling, Train scheduling|
|Persistent URL||dx.doi.org/10.1007/s10479-017-2644-7, hdl.handle.net/1765/102271|
|Journal||Annals of Operations Research|
Harbering, J. (Jonas), Ranade, A. (Abhiram), Schmidt, M.E, & Sinnen, O. (Oliver). (2017). Complexity, bounds and dynamic programming algorithms for single track train scheduling. Annals of Operations Research, 1–22. doi:10.1007/s10479-017-2644-7