| 预知两种信息带准备时间的两台同型机半在线排序 |
| |
| 引用本文： | 李蒙,孙秋媚,封汉颖. 预知两种信息带准备时间的两台同型机半在线排序[J]. 数学的实践与认识, 2011, 41(20) |
| |
| 作者姓名： | 李蒙 孙秋媚 封汉颖 |
| |
| 作者单位： | 军械工程学院基础部,河北石家庄,050003 |
| |
| 摘 要： | 研究了P2,r_j/decr,opt/Cmax问题,即预知工件大小非增排列decr和最优目标值opt的两台同型机的带准备时间的半在线问题,并给出了竞争比为7/6的半在线算法.
|
| 关 键 词： | 同型机排序 半在线 近似算法 竞争比 |
A Semi-online Scheduling Problem with Two Types of Information on Two Identical Machines with Non-simultaneous Machine Release Times |
| |
| LI Meng,SUN Qiu-mei,FENG Han-ying. A Semi-online Scheduling Problem with Two Types of Information on Two Identical Machines with Non-simultaneous Machine Release Times[J]. Mathematics in Practice and Theory, 2011, 41(20) |
| |
| Authors: | LI Meng SUN Qiu-mei FENG Han-ying |
| |
| Affiliation: | LI Meng,SUN Qiu-mei,FENG Han-ying (Department of Basic Courses,Ordnance Engineering College,Shijiazhuang 050003,China) |
| |
| Abstract: | This paper considers the problem P2,r_j/ decr,opt/Cmax,i.e.the semi-online problem on two identical machines with non-increasing sizes of all jobs and the optimal objective function value known in advance.A semi-online algorithm with competitive ratio 7/6 is presented. |
| |
| Keywords: | identical machine scheduling semi-online approximation algorithm competitive ratio |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
