Greedy multiprocessor server scheduling

DOI10.1016/j.orl.2005.07.005zbMath1133.90334OpenAlexW2088632781MaRDI QIDQ2466596

Carl Bussema, Eric Torng

Publication date: 15 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.005

zbMATH Keywords

algorithmsflowmultiprocessoronline schedulinggreedy\(\ell_p\) norm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

The efficiency-fairness balance of round robin scheduling ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Non-clairvoyantly scheduling to minimize convex functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the flow time without migration
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Server scheduling in the L _p norm
• Online Scheduling to Minimize Average Stretch
• Algorithms for minimizing weighted flow time
• LATIN 2004: Theoretical Informatics
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Greedy multiprocessor server scheduling