Fastest, Average and Quantile Schedule

DOI10.1007/978-3-662-46078-8_17zbMath1435.90066OpenAlexW36022413MaRDI QIDQ5175106

Torsten Klug, Armin Fügenschuh, Thomas Schlechte, Konstanty Junosza-Szaniawski, Sławomir Kwasiborski

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_17

zbMATH Keywords

scheduleEulerian multigraphsgenerating permutations with repetitions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Fastest, Average and Quantile Schedule