A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines

DOI10.1007/978-3-540-93980-1_4zbMath1209.68657OpenAlexW2179080494MaRDI QIDQ3602828

Jiří Sgall, Tomáš Ebenlendr

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_4

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items

Online scheduling with preemption or non-completion penalties, Online scheduling with immediate and reliable lead-time quotation

Cites Work

• Unnamed Item
• Online Scheduling of Equal-Length Jobs on Parallel Machines
• Online Scheduling with Hard Deadlines
• Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
• Online Scheduling with Hard Deadlines on Parallel Machines
• Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines