Open Problems in Throughput Scheduling

DOI10.1007/978-3-642-33090-2_2MaRDI QIDQ2912821zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(11)

• Parameterized complexity of machine scheduling: 15 open problems
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
• Scheduling Resources for Throughput Maximization
• Open Problem—M/G/1 Scheduling with Preemption Delays
• Buffer minimization with conflicts on a line
• Throughput scheduling with equal additive laxity
• Throughput scheduling with equal additive laxity
• scientific article; zbMATH DE number 7765369 (Why is no real title available?)
• On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
• Approximations for Throughput Maximization
• Minimizing the number of tardy jobs with uniform processing times on parallel machines

This page was built for publication: Open Problems in Throughput Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912821)