Resource augmentation in load balancing.

DOI10.1002/1099-1425(200009/10)3:5%3C249::AID-JOS46%3E3.0.CO;2-9zbMATH Open1153.90411OpenAlexW2040207325MaRDI QIDQ1588053FDOQ1588053

Authors: Yossi Azar, Leah Epstein, Rob van Stee 

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%3C249::aid-jos46%3E3.0.co;2-9

Recommendations

• scientific article; zbMATH DE number 1617258
• On-line load balancing for related machines
• Improved bounds for on-line load balancing
• scientific article; zbMATH DE number 1256657
• On-line load balancing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Bounds for Certain Multiprocessing Anomalies
• A lower bound for randomized on-line scheduling algorithms
• An optimal algorithm for preemptive on-line scheduling
• Scheduling with deadlines and loss functions
• A lower bound for randomized on-line multiprocessor scheduling
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling in the dark

Cited In (7)

• Worst-case performance evaluation on multiprocessor task scheduling with resource augmentation
• Title not available (Why is that?)
• Minimizing the maximum starting time on-line
• Applying extra-resource analysis to load balancing.
• Resource augmented semi-online bounded space bin packing
• Online multidimensional load balancing
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1588053)