Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions

@inproceedings{Braun2015WorstcaseAO,
  title={Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions},
  author={Oliver Braun and Fan Chung},
  year={2015}
}
We consider the following scheduling problem. We are given a set S of jobs which are to be scheduled sequentially on a single processor. Each job has an associated processing time which is required for its processing. Given a particular permutation of the jobs in S, the jobs are processed in that order with each job started as soon as possible, subject only to the following constraint: For a fixed integer B ≥ 2, no unit time interval [x, x + 1) is allowed to intersect more than B jobs for any… CONTINUE READING
2 Citations
7 References
Similar Papers

Citations

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

References

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

2014b) Bounds on single processor scheduling with time restrictions

  • O Braun, F Chung, RL Graham
  • 2014
Highly Influential
16 Excerpts

GrahamRL (2014a) Single processor scheduling with time restrictions

  • O Braun, F Chung
  • J Sched
  • 2014

Bounds for certain multiprocessing anomalies

  • Freeman, RL NewYorkGraham
  • Bell Syst Tech J 45:1563–1581 Graham RL
  • 1966

Bounds on certain multiprocessing anomalies

  • RL Graham
  • Bell System Technical Journal
  • 1966
2 Excerpts

Bounds on single processor scheduling with time restrictions

  • O Braun, F Chung, RL Graham

Similar Papers

Loading similar papers…