A linear time approximation algorithm for multiprocessor scheduling
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.
Key wordsscheduling minimum finish time approximation algorithm
Unable to display preview. Download preview PDF.
- 2.E. G. Coffman and Ravi Sethi,A generalized bound on LPT scheduling, Revue française d'automatique informatique recherche operationelle, vol. 10, no. 5, May 1976, pp. 17–25.Google Scholar
- 3.E. G. Coffman, ed.,Computer and job/shop scheduling theory, John Wiley, New York, 1976.Google Scholar
- 4.M. R. Garey and D. S. Johnson,Computers and intractability, Freeman, San Francisco, 1979.Google Scholar
- 6.E. Horowitz and S. Sahni,Fundamentals of data structures, Computer Science Press, Potomac Md. 1976.Google Scholar
- 7.E. Horowitz and S. Sahni,Fundamentals of computer algorithms. Computer Science Press, Potomac Md. 1978.Google Scholar
- 8.J. D. Ullman,Complexity of sequencing problems, Computer and Job/shop scheduling theory, E. G. Coffman, ed. John Wiley, New York, 1976, Chap. 4.Google Scholar
- 9.J. H. Ahrens and U. Dieter,A combinatorial method for the generation of normally distributed random numbers, Math. Comp., vol. 27, Oct. 1973, 927–937.Google Scholar