| 工件有尺寸且分两批到达的单机分批排序 |
| |
| 引用本文： | 张玉忠,柏庆国,徐健腾.工件有尺寸且分两批到达的单机分批排序[J].运筹学学报,2006,10(4):99-105. |
| |
| 作者姓名： | 张玉忠 柏庆国 徐健腾 |
| |
| 作者单位： | 曲阜师范大学运筹与管理学院,山东日照,276826 |
| |
| 基金项目： | 国家自然科学基金:10671108，山东省自然科学基金:Y2005A04 |
| |
| 摘 要： | 本文首次研究了工件有尺寸大小,有到达时间的分批排序问题,这里目标函数为工件的极大完工时间．就所有工件有两个到达时间的且工件加工时间与尺寸大小一致的排序给出算法,并证明了算法的性能比不超过33/14．
|
| 关 键 词： | 运筹学 分批排序 离线算法 性能比 |
| 收稿时间： | 2005-03-14 |
| 修稿时间： | 2005年3月14日 |
Scheduling On a Single Batch Processing Machine with Non-identical Job Sizes and Two Release Times |
| |
| Zhang Yuzhong,Bai Qingguo,Xu Jianteng.Scheduling On a Single Batch Processing Machine with Non-identical Job Sizes and Two Release Times[J].OR Transactions,2006,10(4):99-105. |
| |
| Authors: | Zhang Yuzhong Bai Qingguo Xu Jianteng |
| |
| Abstract: | In this paper, we firstly consider the problem of minimizing the maximum completed time on a single batch processing machine if the jobs have different processing times and sizes. We provide an algorithm for the special case in which the jobs have two release times and prove that its worst case ratio is not more than 33/14. |
| |
| Keywords: | Operations research batching scheduling off-line algorithm wrost case ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
