On-line scheduling of unit time jobs with rejection: minimizing the total completion time

@article{Epstein2002OnlineSO,
  title={On-line scheduling of unit time jobs with rejection: minimizing the total completion time},
  author={Leah Epstein and John Noga and Gerhard J. Woeginger},
  journal={Oper. Res. Lett.},
  year={2002},
  volume={30},
  pages={415-420}
}
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio 2 (2 + √ 3) ≈ 1:86602. Moreover, we prove that there does not exist an on-line… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Scheduling under hybrid mode with additive manufacturing

2015 IEEE 19th International Conference on Computer Supported Cooperative Work in Design (CSCWD) • 2015

Online Scheduling for Cloud Computing and Different Service Levels

2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum • 2012
View 1 Excerpt

References

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

On-line Algorithms: The State of the Art

J. Sgall
On-line scheduling, • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…