Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The competitiveness of on-line assignments
Journal of Algorithms
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
On-line load balancing of temporary tasks
Journal of Algorithms
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An improved lower bound for load balancing of tasks with unknown duration
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
On-line Load Balancing for Related Machines
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Load Balancing for Response Time
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Off-Line Temporary Tasks Assignment
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On-Line Load Balancing of Temporary Tasks on Identical Machines
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
On-line restricted assignment of temporary tasks with unknown durations
Information Processing Letters
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
| Hi-index | 0.00 |
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 unapproximability for the general case.