| 具有服务等级的两台同型机实时在线排序 |
| |
| 引用本文： | 侯丽英. 具有服务等级的两台同型机实时在线排序[J]. 运筹学学报, 2016, 20(2): 49-58. DOI: 10.15960/j.cnki.issn.1007-6093.2016.02.004 |
| |
| 作者姓名： | 侯丽英 |
| |
| 作者单位： | 1. 南京农业大学理学院, 南京 210095 |
| |
| 基金项目： | 国家自然科学基金(No. 11426133), 南京农业大学青年科技创新基金(No. 0506J0116) |
| |
| 摘 要： | 考虑具有服务等级的两台同型机在线排序问题, 其中工件带有到达时间, 目标为最小化最大完工时间, 设计了竞争比为frac{7}{4}的在线算法.
|
| 关 键 词： | 在线排序 服务等级 到达时间 竞争比 |
| 收稿时间： | 2015-05-08 |
Online hierarchical service scheduling on two identical machines with release times |
| |
| HOU Liying. Online hierarchical service scheduling on two identical machines with release times[J]. OR Transactions, 2016, 20(2): 49-58. DOI: 10.15960/j.cnki.issn.1007-6093.2016.02.004 |
| |
| Authors: | HOU Liying |
| |
| Affiliation: | 1. College of Science, Nanjing Agricultural University, Nanjing 210095, China |
| |
| Abstract: | This paper considers online scheduling problem on two identical machines under a grade of service, where jobs arrive online over time. The objective is to minimize the maximum completion time. We propose an online algorithm with competitive ratio frac{7}{4}. |
| |
| Keywords: | online scheduling grade of service release time competitive ratio |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
|
点击此处可从《运筹学学报》下载全文 |
