Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

@article{Ibarra1977HeuristicAF,
  title={Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors},
  author={Oscar H. Ibarra and Chul E. Kim},
  journal={J. ACM},
  year={1977},
  volume={24},
  pages={280-289}
}
The finishing time properties of several heuristic algorithms for scheduling <italic>n</italic> independent tasks on <italic>m</italic> nonidentical processors are studied. In particular, for <italic>m</italic> = 2 an <italic>n</italic> log <italic>n</italic> time-bounded algorithm is given which generates a schedule having a finishing time of at most (√5 + 1)/2 of the optimal finishing time. A simplified scheduling problem involving identical processors and restricted task sets is shown to be… CONTINUE READING
Highly Influential
This paper has highly influenced 60 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 818 citations. REVIEW CITATIONS

Topics

Statistics

050'78'81'85'89'93'97'01'05'09'13'17
Citations per Year

818 Citations

Semantic Scholar estimates that this publication has 818 citations based on the available data.

See our FAQ for additional information.