Non-clairvoyant scheduling for weighted flow time

DOI10.1016/S0020-0190(03)00231-XzbMath1175.68078OpenAlexW2077348732MaRDI QIDQ1014388

Kyung-Yong Chwa, Jae-Hoon Kim

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00231-x

zbMATH Keywords

schedulingflow timenon-clairvoyance

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for preemptive weighted flow time
• Speed is as powerful as clairvoyance
• Online Scheduling to Minimize Average Stretch
• Algorithms for minimizing weighted flow time
• Scheduling in the dark

This page was built for publication: Non-clairvoyant scheduling for weighted flow time