TY - CONF
A1 - Klug, Torsten
A1 - Junosza-Szaniawski, Konstanty
A1 - Kwasiborski, Slawomir
A1 - Fügenschuh, Armin
A1 - Schlechte, Thomas
T1 - Fastest, Average and Quantile Schedule
T2 - SOFSEM 2015: Theory and Practice of Computer Science
N2 - We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.
KW - scheduling
KW - eulerian multigraphs
Y1 - 2015
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/5759
SP - 201
EP - 216
PB - Springer Berlin Heidelberg
ER -