Online Preemptive Scheduling with Immediate Decision or Notification and Penalties

DOI10.1007/978-3-642-14031-0_42zbMath1286.90056OpenAlexW1583737895MaRDI QIDQ3578339

Stanley P. Y. Fung

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_42

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online scheduling with immediate and reliable lead-time quotation ⋮ Competitive analysis for make-to-order scheduling with reliable lead time quotation

This page was built for publication: Online Preemptive Scheduling with Immediate Decision or Notification and Penalties