We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected jobs.In the problem,a set of independent jobs ...We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected jobs.In the problem,a set of independent jobs arriving online over time has to be scheduled with the flexibility of rejecting some of the jobs,where preemption is not allowed and the information of each job,including its processing time,release date,weight,and rejection penalty,is not known in advance.For this problem,using a technique named Greedy-Interval-Rejection,we provide an online algorithm with a competitive ratio of at most 4+εon identical machines and an online algorithm with a competitive ratio of at most 8 on unrelated machines,respectively。展开更多
基金the National Natural Science Foundation of China(Nos.11271338,11171313 and 11301528).
文摘We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected jobs.In the problem,a set of independent jobs arriving online over time has to be scheduled with the flexibility of rejecting some of the jobs,where preemption is not allowed and the information of each job,including its processing time,release date,weight,and rejection penalty,is not known in advance.For this problem,using a technique named Greedy-Interval-Rejection,we provide an online algorithm with a competitive ratio of at most 4+εon identical machines and an online algorithm with a competitive ratio of at most 8 on unrelated machines,respectively。
