Complexity, bounds and dynamic programming algorithms for single track train scheduling

DOI10.1007/s10479-017-2644-7zbMath1410.90088OpenAlexW2760984876MaRDI QIDQ1730675

Jonas Harbering, Oliver Sinnen, Marie E. Schmidt, Abhiram G. Ranade

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2644-7

zbMATH Keywords

machine schedulingdynamic programmingcomplexity analysistrain schedulingcounter routes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing the simplon railway corridor
• Locating optimal timetables and vehicle schedules in a transit line
• Timetabling optimization of a single railway track line with sensitivity analysis
• The one-machine sequencing problem
• On some geometric methods in scheduling theory: A survey
• Nominal and robust train timetabling problems
• Heuristic techniques for single line train scheduling
• A Survey of Optimization Models for Train Routing and Scheduling
• An algorithm for the solution of the two-route Johnson problem
• Scheduling Bidirectional Traffic on a Path
• Unit Execution Time Shop Problems
• The Complexity of Flowshop and Jobshop Scheduling
• Computational Complexity of Discrete Optimization Problems
• On- and Offline Scheduling of Bidirectional Traffic
• Ship Traffic Optimization for the Kiel Canal
• Two-Way Traffic on a Single Line of Railway
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Complexity, bounds and dynamic programming algorithms for single track train scheduling