Online load balancing with general reassignment cost
Open Access
- 1 April 2022
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 50 (3) , 322-328
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Robust Approximation Schemes for Cube PackingSIAM Journal on Optimization, 2013
- Robust Algorithms for Preemptive SchedulingAlgorithmica, 2012
- A robust APTAS for the classical bin packing problemMathematical Programming, 2007
- Improved Bounds for the Online Scheduling ProblemSIAM Journal on Computing, 2003
- Competitive Routing of Virtual Circuits with Unknown DurationJournal of Computer and System Sciences, 2001
- Load Balancing for Response TimeJournal of Algorithms, 2000
- Improved Bounds for On-Line Load BalancingAlgorithmica, 1999
- Better Bounds for Online SchedulingSIAM Journal on Computing, 1999
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991