| Article ID: | iaor20102945 |
| Volume: | 37 |
| Issue: | 2 |
| Start Page Number: | 80 |
| End Page Number: | 82 |
| Publication Date: | Mar 2009 |
| Journal: | Operations Research Letters |
| Authors: | Hurkens Cor A J, Woeginger Gerhard J, Eggermont Christian, Modelski Maciej |
| Keywords: | computational analysis |
We derive several results on the computational complexity of train rearrangement problems in railway optimization. Our main result states that arranging a departing train in a depot is NP-complete, even if each track in the depot contains only two cars.