Utilization of nonclairvoyant online schedules

DOI10.1016/J.TCS.2006.06.027MaRDI QIDQ2508980zbMATH OpenOpenAlexWikidataFDO

Authors Mohamed Eid Hussein, Uwe Schwiegelshohn

Publication date 20 October 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.06.027

zbMATH Keywords

online schedulingutilization

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 437567
• Nonclairvoyant scheduling
• On an on-line scheduling problem for parallel jobs
• On-line scheduling of two-machine open shops where jobs arrive over time
• scientific article; zbMATH DE number 1670659

Cites work

• Better Bounds for Online Scheduling
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• Minimizing flow time nonclairvoyantly
• Nonclairvoyant scheduling
• On an on-line scheduling problem for parallel jobs
• Online algorithms. The state of the art
• Scheduling Parallel Machines On-Line
• Speed is as powerful as clairvoyance

Cited in

(1)

• A system-centric metric for the evaluation of online job schedules

This page was built for publication: Utilization of nonclairvoyant online schedules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508980)