Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines

DOI10.1007/11785293_13zbMath1141.90426OpenAlexW1517334619MaRDI QIDQ5757896

Michael H. Goldwasser, Mark Pedigo

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11785293_13

zbMATH Keywords

AlgorithmsSchedulingOnline

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts ⋮ A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines

This page was built for publication: Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines