Journal ArticleDOI
A linear time approximation algorithm for multiprocessor scheduling
Greg Finn,Ellis Horowitz +1 more
TLDR
AnO(n) approximation algorithm is presented which tries to determine a nonpreemptive schedule with minimum finish time and extensive empirical results show that the new algorithm is competitive with the LPT algorithm in terms of quality of solution and faster interms of computing time.Abstract:
Givenn jobs andm identical processors anO(n) approximation algorithm is presented which tries to determine a nonpreemptive schedule with minimum finish time. Ifr is the number of jobs placed onto the processor with maximum finish time, then the worst case ratio of the new algorithm's finish time to the optimal solution is shown to be less thanrm/(rm−m+1). Extensive empirical results show that the new algorithm is competitive with the LPT algorithm in terms of quality of solution and faster in terms of computing time.read more
Citations
More filters
Book
The Design of Approximation Algorithms
TL;DR: In this paper, the authors present a survey of the central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization.
Journal ArticleDOI
A state-of-the-art review of parallel-machine scheduling research
T.C.E. Cheng,C.C.S. Sin +1 more
TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.
Book ChapterDOI
Approximation Algorithms for Bin-Packing — An Updated Survey
TL;DR: This paper updates a survey written about 3 years ago with many new results, some of which represent important advances, and more than doubles the list in [53].
Book ChapterDOI
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
TL;DR: This work focuses on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.
Book ChapterDOI
Convergence time to Nash equilibria
TL;DR: The number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will minimize its cost is studied.
References
More filters
Journal ArticleDOI
An Application of Bin-Packing to Multiprocessor Scheduling
TL;DR: This work considers one of the basic, well-studied problems of scheduling theory, that of nonpreemptively scheduling n independent tasks on m identical, parallel processors with the objective of minimizing the number of overlapping tasks.