Online Scheduling with Hard Deadlines on Parallel Machines

DOI10.1007/11775096_5zbMath1137.90488OpenAlexW1539914310MaRDI QIDQ5434380

Jihuan Ding, Guo-Chuan Zhang

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11775096_5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Online scheduling with preemption or non-completion penalties ⋮ A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines

This page was built for publication: Online Scheduling with Hard Deadlines on Parallel Machines