Resource augmentation in load balancing.

DOI<link itemprop=identifier href="https://doi.org/10.1002/1099-1425(200009/10)3:5<249::AID-JOS46>3.0.CO;2-9" /><249::AID-JOS46>3.0.CO;2-9 10.1002/1099-1425(200009/10)3:5<249::AID-JOS46>3.0.CO;2-9zbMath1153.90411OpenAlexW2040207325MaRDI QIDQ1588053

Yossi Azar, Rob van Stee, Leah Epstein

Publication date: 27 July 2003

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

Full work available at URL: https://doi.org/10.1002/1099-1425(200009/10)3:5<249::aid-jos46>3.0.co;2-9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION ⋮ Resource augmented semi-online bounded space bin packing ⋮ Minimizing the maximum starting time on-line

Cites Work

• A lower bound for randomized on-line multiprocessor scheduling
• A lower bound for randomized on-line scheduling algorithms
• An optimal algorithm for preemptive on-line scheduling
• Scheduling with Deadlines and Loss Functions
• Bounds for Certain Multiprocessing Anomalies
• Scheduling in the dark
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource augmentation in load balancing.