Complexity, bounds and dynamic programming algorithms for single track train scheduling
Year of publication: |
2019
|
---|---|
Authors: | Harbering, Jonas ; Ranade, Abhiram ; Schmidt, Marie Elisabeth ; Sinnen, Oliver |
Published in: |
Operations research for transportation. - New York, NY, USA : Springer. - 2019, p. 479-500
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Dynamische Optimierung | Dynamic programming | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Legrain, Antoine, (2023)
-
An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems
Ghoniem, Ahmed, (2015)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
- More ...
-
A new two-stage heuristic for the recreational vehicle scheduling problem
Kulkarni, Sarang, (2018)
-
Minimizing the passengers' traveling time in the stop location problem
Carrizosa, Emilio, (2016)
-
Delay resistant line planning with a view towards passenger transfers
Harbering, Jonas, (2017)
- More ...