| Q2,rj|sum|Cmin问题的半在线排序 |
| |
| 引用本文： | 李立亚.Q2,rj|sum|Cmin问题的半在线排序[J].培训与研究,2007,24(8):8-9. |
| |
| 作者姓名： | 李立亚 |
| |
| 作者单位： | 湖北第二师范学院数学与计量经济系 武汉430061 |
| |
| 摘 要： | 本文研究两台平行同类机的一个半在线排序问题。当机器是有准备时间的同类机时,总加工时间已知,文章给出了一个竞争比至少为的半在线算法,同时给出了证明。
|
| 关 键 词： | 半在线 排序 竞争比 |
| 文章编号： | 1007-1687（2007）08-0008-02 |
| 修稿时间： | 2007-05-10 |
Semi On-line Scheduling for Q2,rj|sum|Cmin |
| |
| LI Li-ya.Semi On-line Scheduling for Q2,rj|sum|Cmin[J].Training and Research-Journal of Hubei College of Education,2007,24(8):8-9. |
| |
| Authors: | LI Li-ya |
| |
| Institution: | Department of Mathematics and Measure Economics, Hubei University of Education, Wuhan 430205, China |
| |
| Abstract: | This paper analyses semi on-line scheduling problems on two machine system.If the machine is uniform ones with available time,it is assumed that the total processing time is known in advance.And a semi on-line algorithm with the competitive ratio at least is proved. |
| |
| Keywords: | semi on-line algorithm scheduling competitive ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
