| 交货期窗口待定的有界同时加工排序问题的最优算法 |
| |
| 引用本文： | 韩国勇,赵洪銮,刘浩,刘振栋,张志军.交货期窗口待定的有界同时加工排序问题的最优算法[J].山东大学学报(理学版),2012,47(3):77-80,86. |
| |
| 作者姓名： | 韩国勇 赵洪銮 刘浩 刘振栋 张志军 |
| |
| 作者单位： | 山东建筑大学计算机科学与技术学院,山东济南,250101 |
| |
| 基金项目： | 山东省科技发展计划项目(2010GGX10129);山东省自然科学基金资助项目(Y2008G29) |
| |
| 摘 要： | 结合窗时排序与同时加工排序,考虑单机器上批容量有限的情形,为享有公共交货期窗口e,d]的n个工件分批并排序,以最小化总的赋权提前和延误的工件个数;将最早交货期e和窗口大小K作为未知参数,与最优序列一起确定使得总费用最小。在给出的最优排序的若干性质基础上提出了多项式时间算法。
|
| 关 键 词： | 批 交货期窗口 提前 延误 |
The algorithm of the bounded batch scheduling problem with a decision due window |
| |
| HAN Guo-yong,ZHAO Hong-luan,LIU Hao,LIU Zhen-dong,ZHANG Zhi-jun.The algorithm of the bounded batch scheduling problem with a decision due window[J].Journal of Shandong University,2012,47(3):77-80,86. |
| |
| Authors: | HAN Guo-yong ZHAO Hong-luan LIU Hao LIU Zhen-dong ZHANG Zhi-jun |
| |
| Institution: | (School of Computer Science & Technology,Shandong Jianzhu University,Jinan 250101,Shandong,China) |
| |
| Abstract: | The due window situation is combined with the conception of batch so that the jobs can be processed in batches on a single machine.To minimize the weighted number of early and tardy jobs,the batch is bounded and all the jobs share a common due window.Further,the location and size of the due window are decision variables,and the optimal sequence is determined.An efficient algorithm is proposed with several optimal properties. |
| |
| Keywords: | batch due window earliness tardiness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
