论文信息 - On-line scheduling of unit time jobs with rejection: minimizing the total completion time

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

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 12(2+3)~1.86602. Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784.

[1] Leen Stougie,et al. Multiprocessor scheduling with rejection , 1996, SODA '96.

[2] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .

[3] David R. Karger,et al. Techniques for scheduling with rejection , 1998, J. Algorithms.

[4] Steven S. Seiden. Preemptive multiprocessor scheduling with rejection , 2001, Theor. Comput. Sci..

[5] Han Hoogeveen,et al. Preemptive scheduling with rejection , 2000, Math. Program..

[6] Jirí Sgall,et al. On-line Scheduling , 1996, Online Algorithms.

[7] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .