Open Problems in Throughput Scheduling

DOI10.1007/978-3-642-33090-2_2zbMath1365.90148OpenAlexW123039402MaRDI QIDQ2912821

Jiří Sgall

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_2

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Online algorithms; streaming algorithms (68W27)

Related Items

On the fine-grained parameterized complexity of partial scheduling to minimize the makespan, Unnamed Item, Unnamed Item, Parameterized complexity of machine scheduling: 15 open problems, Buffer minimization with conflicts on a line, Throughput scheduling with equal additive laxity, Throughput scheduling with equal additive laxity