Online load balancing of temporary tasks
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fast approximation algorithms for fractional packing and covering problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On-line load balancing with applications to machine scheduling and virtual circuit routingPublished by Association for Computing Machinery (ACM) ,1993
- New algorithms for an ancient scheduling problemPublished by Association for Computing Machinery (ACM) ,1992
- On-line load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Fast approximation algorithms for multicommodity flow problemsPublished by Association for Computing Machinery (ACM) ,1991
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Provably good routing in graphs: regular arraysPublished by Association for Computing Machinery (ACM) ,1985
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966