| 一类工件有尺寸且分两次到达的在线分批排序 |
| |
| 引用本文： | 柏庆国,徐健腾,张玉忠.一类工件有尺寸且分两次到达的在线分批排序[J].青岛科技大学学报,2007,28(3):270-272. |
| |
| 作者姓名： | 柏庆国 徐健腾 张玉忠 |
| |
| 作者单位： | [1]曲阜师范大学运筹与管理学院,山东日照276826 [2]哈尔滨工业大学管理学院,黑龙江哈尔滨150001 |
| |
| 摘 要： | 研究了工件有尺寸大小,有到达时间的在线分批排序,目标函数为工件的极大完工时间。就所有工件有2个到达时间的在线分批排序,给出算法,并证明了算法的竞争比不超过3。
|
| 关 键 词： | 运筹学 在线算法 分批排序 竞争比 |
| 文章编号： | 1672-6987（2007）03-0270-03 |
| 收稿时间： | 2006-09-08 |
| 修稿时间： | 2006-09-08 |
On-line Batch Scheduling on a Single Machine with Non-identical Job Sizes and Two Arrival Times |
| |
| BAI Qing-guo,XU Jian-teng,ZHANG Yu-zhong.On-line Batch Scheduling on a Single Machine with Non-identical Job Sizes and Two Arrival Times[J].Journal of Qingdao University of Science and Technology:Natutral Science Edition,2007,28(3):270-272. |
| |
| Authors: | BAI Qing-guo XU Jian-teng ZHANG Yu-zhong |
| |
| Affiliation: | 1. College of Operation Research and Management, Qufu Normal University,Rizhao 276826,China; 2. School of Management, Harbin Institute of Technology, Harbin 150001, China |
| |
| Abstract: | In this paper, we firstly consider the problem of the maximize completed time on a single batch processing, whose jobs have different processing times and different sizes. For all jobs with two arrival times, we provide an on-line Batch Scheduling algorithm. It has demonstrated that its competitive ratio was less than 3. |
| |
| Keywords: | Operational Research on-line algorithms batch scheduling the competitive ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
