Online Scheduling of Equal-Length Jobs on Parallel Machines

DOI10.1007/978-3-540-75520-3_39zbMath1151.90404OpenAlexW1504289907MaRDI QIDQ3527232

Jihuan Ding, Jiří Sgall, Tomáš Ebenlendr, Guo-Chuan Zhang

Publication date: 25 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_39

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Online scheduling with preemption or non-completion penalties ⋮ Online scheduling with immediate and reliable lead-time quotation ⋮ Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines ⋮ Parallel machine problems with equal processing times: a survey ⋮ A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines

This page was built for publication: Online Scheduling of Equal-Length Jobs on Parallel Machines