Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421218 | Discrete Applied Mathematics | 2012 | 22 Pages |
This paper aims to start an analytical study of the computational complexity of some online shunting problems. 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.We show that this problem can be modeled with online coloring of graphs. Depending on the constraints, the graphs can be overlap graphs (also known as circle graphs) or permutation graphs, and the coloring can be bounded or classical. This paper covers several combinations of these cases.