| 关键设备工序紧凑的动态调度算法 |
| |
| 引用本文： | 谢志强,郑翘,刘胜辉. 关键设备工序紧凑的动态调度算法[J]. 哈尔滨理工大学学报, 2003, 8(2): 50-53 |
| |
| 作者姓名： | 谢志强 郑翘 刘胜辉 |
| |
| 作者单位： | 哈尔滨理工大学,计算机与控制学院,黑龙江,哈尔滨,150080;哈尔滨职业技术学院,黑龙江,哈尔滨,150000 |
| |
| 基金项目： | 国家自然科学基金资助(69984002)，黑龙江省优秀回国人员基金(F9918)，哈尔滨市留学回国人员基金(9883218004) |
| |
| 摘 要： | 针对求动态Job-Shop调度最优解这一复杂问题，提出了通过对不同时刻开始加工产品加工树的分解方法，将产品加工工序分为存在具有惟一紧前、紧后相关工序和独立工序，在对这两类工序分批、综合研究时，应用拟关键路径法(ACPM)和最佳适应调度方法(BFSM)调度，并考虑了关键设备的工序紧凑性、通过分析与实例验证，所提出的调度方法对解决动态的Job-Shop调度问题不仅算法简练，而又效果较好。
|
| 关 键 词： | 动态Job-Shop调度 拟关键路径法 最佳适应调度法 关键设备 |
| 文章编号： | 1007-2683(2003)02-0050-04 |
| 修稿时间： | 2002-11-20 |
A Dynamic Scheduling Algorithm Based on Key Equipment''''s Compact Procedures |
| |
| XIE Zhi-qiang,ZHENG Qiao,LIU Sheng-hui. A Dynamic Scheduling Algorithm Based on Key Equipment''''s Compact Procedures[J]. Journal of Harbin University of Science and Technology, 2003, 8(2): 50-53 |
| |
| Authors: | XIE Zhi-qiang ZHENG Qiao LIU Sheng-hui |
| |
| Abstract: | As to a complicated problem of request dynamic Job -Shop scheduling optimum result, the working procedures of products could be divided into the attached one which has the only precursor and subsequence and unattached one by analyzing products, which processed start on different time, procession tree. When ACPM (allied critical path method) and BFSM (best fit scheduling method) are applied to these two procedures and considering the procedures are grouped, the compact of the procedures should be taken into account. The scheduling algorithm presented in this paper is concise and satisfying for settling dynamic Job -Shop scheduling by being tested with practical examples. |
| |
| Keywords: | dynamic Job-Shop scheduling ACPM BFSM key equipment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
