| Article ID: | iaor20172781 |
| Volume: | 34 |
| Issue: | 2 |
| Start Page Number: | 483 |
| End Page Number: | 503 |
| Publication Date: | Aug 2017 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Yuan Jinjiang, Ma Ran |
| Keywords: | optimization, combinatorial optimization, scheduling, manufacturing industries |
We consider the online scheduling on a single machine, in which jobs are released over time and each job can be either accepted and scheduled on the machine or rejected under a certain rejection cost. The goal is to minimize the total weighted completion time of the accepted jobs plus the total rejection cost of the rejected jobs. For this problem, we provide an online algorithm with a best possible competitive ratio of 2.