The hardness of train rearrangements

DOI10.1016/J.ORL.2008.12.005MaRDI QIDQ1015300zbMATH OpenOpenAlexFDO

Authors Cor Hurkens, Maciej Modelski, Christian E. J. Eggermont, Gerhard J. Woeginger

Publication date 7 May 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2008.12.005

zbMATH Keywords

computational complexityplanningrailway optimizationshunting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The train marshalling problem
• Scheduling trams in the morning
• Waiting for trains: complexity results
• Routing trains through railway stations: Complexity issues
• Online train shunting

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• NP completeness of the edge precoloring extension problem on bipartite graphs
• Real-time dispatch of trams in storage yards
• Scheduling trams in the morning

Cited in

(7)

• Scheduling trams in the morning
• Reversing trains: A turn of the century sorting problem
• Solving the train marshalling problem by inclusion-exclusion
• A note on ``Multistage methods for freight train classification
• Two railway circuits: A universal circuit and an NP-difficult one
• Military vehicle shifting in roll-on/roll-off terminals
• A tight lower bound for the train reversal problem

This page was built for publication: The hardness of train rearrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015300)