Applying extra-resource analysis to load balancing.

DOI<273::AID-JOS48>3.0.CO;2-0 10.1002/1099-1425(200009/10)3:5<273::AID-JOS48>3.0.CO;2-0zbMath1153.90416OpenAlexW2063156615MaRDI QIDQ1588056

Mark Brehob, Patchrawat Uthaisombut, Eric Torng

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<273::aid-jos48>3.0.co;2-0

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Parallel machines scheduling with machine maintenance for minsum criteria ⋮ Robust surgery loading ⋮ WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION ⋮ Minimizing the maximum starting time on-line ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 13/12 approximation algorithm for bin packing with extendable bins
• Improved bounds for harmonic-based bin packing algorithms
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time
• Competitive paging with locality of reference
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• `` Strong NP-Completeness Results
• Bounds for Certain Multiprocessing Anomalies
• Scheduling in the dark

This page was built for publication: Applying extra-resource analysis to load balancing.