| 可拒绝的同类机在线排序(英文) |
| |
| 引用本文： | 刘守鹏,高明海,张玉忠.可拒绝的同类机在线排序(英文)[J].大学数学,2012(1):27-32. |
| |
| 作者姓名： | 刘守鹏 高明海 张玉忠 |
| |
| 作者单位： | 滨州医学院卫生管理学院;曲阜师范大学运筹与管理学院 |
| |
| 基金项目： | The Natural Science Foundation of China under Grant(11001117) |
| |
| 摘 要： | 考虑了带拒绝费用的在线同类机排序模型.工件一个一个的到达,到达后或被接受,或以一定的费用被拒绝,目标是最小化最大完工时间与总的拒绝费用之和.我们提供了一个在线算法和分析了算法的竞赛比.
|
| 关 键 词： | 在线排序 竞赛比 同类机 |
On-line Scheduling with Rejection on Uniform Parallel Machines |
| |
| LIU Shou-peng,Gao Ming-hai,Zhang Yu-zhong.On-line Scheduling with Rejection on Uniform Parallel Machines[J].College Mathematics,2012(1):27-32. |
| |
| Authors: | LIU Shou-peng Gao Ming-hai Zhang Yu-zhong |
| |
| Institution: | 1.Binzhou Medical University,Yantai 264003,China;2.Department of Operations Research and Management,Qufu Normal University,Rizhao 276826,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | on-line scheduling competitive ratio uniform machine |
| 本文献已被 CNKI 等数据库收录！ |
