BIT Numerical Mathematics

, Volume 19, Issue 3, pp 312–320

A linear time approximation algorithm for multiprocessor scheduling

  • Greg Finn
  • Ellis Horowitz

DOI: 10.1007/BF01930985

Cite this article as:
Finn, G. & Horowitz, E. BIT (1979) 19: 312. doi:10.1007/BF01930985


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/(rmm+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 words

schedulingminimum finish timeapproximation algorithm

Copyright information

© BIT Foundations 1979

Authors and Affiliations

  • Greg Finn
    • 1
  • Ellis Horowitz
    • 1
  1. 1.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesU.S.A.