Parallel Scheduling for Early Completion

  title={Parallel Scheduling for Early Completion},
  author={Bo Chen},
  booktitle={Handbook of Scheduling},
This chapter assumes knowledge of some basic scheduling terminology provided in Part I of this book. We are concerned in this chapter with classical deterministic parallel scheduling with the objective of minimizing the makespan. Both preemptive and nonpreemptive schedules are considered. There can be precedence relationships between jobs. Excluded from consideration in this chapter are parallel scheduling models of other typical job characteristics, online and randomized algorithms, all of… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-5 of 5 extracted citations


Publications referenced by this paper.
Showing 1-10 of 65 references

Parallel sequencing and assembly line problems

T. C. Hu
Operations Research • 1961
View 10 Excerpts
Highly Influenced

Tighter Bounds for LPT Scheduling on Uniform Processors

SIAM J. Comput. • 1987
View 4 Excerpts
Highly Influenced

Tighter Bounds for the Multifit Processor Scheduling Algorithm

SIAM J. Comput. • 1984
View 5 Excerpts
Highly Influenced

Worst Case Analysis of Two Scheduling Algorithms

SIAM J. Comput. • 1977
View 6 Excerpts
Highly Influenced

A generalized bound on LPT sequencing

View 6 Excerpts
Highly Influenced

Linear and quadratic algorithms for scheduling chains and opposite chains

European Journal of Operational Research • 2002
View 6 Excerpts
Highly Influenced

Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling

Coffman, E. G., M. R. Garey
Journal of the ACM • 1993
View 5 Excerpts
Highly Influenced

On the exact upper bound for the multifit processor scheduling algorithms

M. Yue
Annals of Operations Research • 1990
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…