Admission control with immediate notification

From MaRDI portal

Revision as of 00:33, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2464394

Jump to:navigation, search

DOI10.1023/A:1022956425198zbMath1154.90456OpenAlexW1565113225MaRDI QIDQ2464394

Boris Kerbikov, Michael H. Goldwasser

Publication date: 20 December 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022956425198

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 Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Competitive analysis for make-to-order scheduling with reliable lead time quotation ⋮ A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts

This page was built for publication: Admission control with immediate notification

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2464394&oldid=15149125"