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 . Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.
- On-line algorithm
- Worst-case bounds
- Competitive Analysis
Epstein, L., Noga, J., & Woeginger, G. (2002). On-line scheduling of unit time jobs with rejection: Minimizing the total completion time. Operations research letters, 30(6), 415-420. https://doi.org/10.1016/S0167-6377(02)00160-8