Decomposing the Train-Scheduling Problem into Integer-Optimal Polytopes.

Masoud Barah Abbas Seifi James Ostrowski

Published in: Transp. Sci. (2019)

Keyphrases

scheduling problem
np hard
tabu search
dynamic programming
single machine
data sets
processing times
optimal design
optimal solution
optimal control
minimum cost
asymptotically optimal
optimal scheduling
worst case
convex hull
floating point