On the online track assignment problem
This paper aims to start an analytical study of the computational complexity of some online We analyze the following problem. Consider a train station consisting of a set of parallel tracks. Each track can be approached from one side only or from both sides and the number of trains per track may be limited or not. The departure times of the trains are fixed according to a given time table. The problem is to assign a track to each train as soon as it arrives and such that it can leave the station on time without being blocked by any other train.
Record created on 2012-05-18, modified on 2016-08-09