| 一类有尺寸大小的在线分批排序问题 |
| |
| 引用本文： | 徐健腾,柏庆国,魏伟.一类有尺寸大小的在线分批排序问题[J].临沂师范学院学报,2006,28(6):17-19. |
| |
| 作者姓名： | 徐健腾 柏庆国 魏伟 |
| |
| 作者单位： | 1. 曲阜师范大学日照校区,运筹与管理学院,山东,日照,276826
2. 曲阜师范大学,团委,山东,曲阜,273165 |
| |
| 基金项目： | 山东省自然科学基金项目资助(Y2005A04) |
| |
| 摘 要： | 研究了工件有尺寸大小的一致性在线分批排序．就所有工件有两个到达时间ri,i=1,2(不妨设r1=0,r2=r)对于0时刻到达的工件中加工时间最大的批满足一定的约束条件下的一致性在线分批排序给出一个在线算法,并证明了算法的竞争比不超过2．357．
|
| 关 键 词： | 运筹学 分批排序 在线算法 竞争比 |
| 文章编号： | 1009-6051（2006）06-0017-03 |
| 收稿时间： | 2006-06-13 |
| 修稿时间： | 2006-06-13 |
A Kind of Problem of On-line Batch Scheduling with Non-identical Job Sizes |
| |
| Xu Jian-teng,Bai Qing-guo,Wei Wei.A Kind of Problem of On-line Batch Scheduling with Non-identical Job Sizes[J].Journal of Linyi Teachers' College,2006,28(6):17-19. |
| |
| Authors: | Xu Jian-teng Bai Qing-guo Wei Wei |
| |
| Institution: | 1. College of Operations Research and Management, Qufu Normal University, Rizhao Shandong 276826, China; 2. Committee of the Communist Youth League, Qufu Normal University, Qufu Shangdong 273165, China |
| |
| Abstract: | In this paper, we consider the proportional problem of on-line batch scheduling with non-identical job sizes. We also provide an on-line algorithm with the competitive ratio not more than 2.357 for the special case that the longest job with arrival 0 satisfies certain restraints. |
| |
| Keywords: | OR batch scheduling on-line algorithm the competitive ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
