Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Balanced allocations for tree-like inputs
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Hierarchies for classes of priority algorithms for job scheduling
Theoretical Computer Science
Randomized priority algorithms
Theoretical Computer Science
Further reflections on a theory for basic algorithms
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Order-preserving transformations and greedy-like algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.89 |
We continue the recent study of priority algorithms initiated by Borodin et al. [Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, 2002, pp. 752-761]. The definition of a priority algorithm nicely captures the idea of a "greedy-like" type algorithm. While priority algorithms are applicable to many optimization problems, in this paper we consider the problem of makespan minimization in scheduling in the subset model. We show that by using a fixed priority algorithm one cannot achieve a considerable improvement over the approximation ratio given by the online greedy algorithm. Namely, we present an Ω(log m/log log m) lower bound on the approximation ratio of any fixed priority algorithm where m is the number of machines.