Parallel Processor Scheduling with Limited Number of Preemptions

@article{Braun2003ParallelPS,
  title={Parallel Processor Scheduling with Limited Number of Preemptions},
  author={Oliver Braun and G{\"u}nter Schmidt},
  journal={SIAM J. Comput.},
  year={2003},
  volume={32},
  pages={671-680}
}
In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is to minimize the makespan, i.e., the completion time of the last job that finishes. We show that the ratio of the optimal ipreemptive schedule length C ∗ max versus the optimal preemptive schedule length C p∗ max is bounded from above by C ∗ max… CONTINUE READING
17 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

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

  • E. G. Coffman, Jr., M. R. Garey
  • J. ACM,
  • 1993
Highly Influential
3 Excerpts

Scheduling with deadlines and loss functions

  • R. McNaughton
  • Management Sci., 6
  • 1959
Highly Influential
3 Excerpts

Scheduling with Limited Available Processors and with Limited Number of Preemptions

  • O. Braun
  • Ph.D. thesis,
  • 2002
2 Excerpts

Complexity of sequencing problems

  • J. D. Ullman
  • Computer and Job-Shop Scheduling Theory, E. G…
  • 1976
1 Excerpt

ed., Computer and Job-Shop Scheduling

  • E. G. Coffman, Jr.
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…