Online scheduling to minimize the total weighted completion time plus the rejection cost |
| |
| Authors: | Ran Ma Jinjiang Yuan |
| |
| Institution: | 1.School of Mathematics and Information Science,Henan Polytechnic University,Jiaozuo,People’s Republic of China;2.School of Mathematics and Statistics,Zhengzhou University,Zhengzhou,People’s Republic of China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
