We consider the version of on-line uniform machines scheduling with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected at a certain penalty. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejection jobs. We propose an on-line algorithm and analyze the competitive ratio.%考虑了带拒绝费用的在线同类机排序模型.工件一个一个的到达,到达后或被接受,或以一定的费用被拒绝,目标是最小化最大完工时间与总的拒绝费用之和.我们提供了一个在线算法和分析了算法的竞赛比.
展开▼
