Non-clairvoyant weighted flow time scheduling on different multi-processor models

DOI10.1007/s00224-013-9475-yzbMath1328.68318OpenAlexW2149580315WikidataQ58062872 ScholiaQ58062872MaRDI QIDQ2344210

Jianqiao Zhu, Ho-Leung Chan, Tak-Wah Lam

Publication date: 12 May 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9475-y

zbMATH Keywords

multiprocessor schedulingcompetitive analysisonline algorithmsweighted flow timenon-clairvoyant scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The two-machine total completion time flow shop problem
• Nonclairvoyant scheduling
• On-line scheduling of two-machine open shops where jobs arrive over time
• Non-clairvoyant Speed Scaling for Weighted Flow Time
• Speed is as powerful as clairvoyance
• Scheduling in the dark
• Tighter bounds on preemptive job shop scheduling with two machines

This page was built for publication: Non-clairvoyant weighted flow time scheduling on different multi-processor models