| Blocking流水车间调度问题的MBT算法研究 |
| |
| 引用本文： | 洪宗友,闫萍,庞哈利. Blocking流水车间调度问题的MBT算法研究[J]. 辽宁师范大学学报(自然科学版), 2007, 30(2): 148-151 |
| |
| 作者姓名： | 洪宗友 闫萍 庞哈利 |
| |
| 作者单位： | 沈阳化工学院数理系,辽宁沈阳,110142;东北大学信息科学与工程学院,辽宁沈阳,110004 |
| |
| 基金项目： | 国家自然科学基金资助项目（70431003）;辽宁省自然科学基金资助项目（20032024）;沈阳市自然科学基金资助项目（10411006-1-03-04） |
| |
| 摘 要： | 针对目标函数为Makespan的Blocking流水车间调度问题，设计了一种构造启发式算法．初始排序的产生从减少下游工件的滞留时间入手，结合有向图中对关键路径的分析，采用插入规则进行搜索的方法得到工件序列的近优排序．通过大量典型算例的计算，实验结果证明了设计的算法具有优越的性能．
|
| 关 键 词： | 流水车间调度 启发式算法 Blocking流水车间 |
| 文章编号： | 1000-1735（2007）02-0148-04 |
| 修稿时间： | 2006-12-15 |
Study on minimum blocked time algorithm for blocking flow-shop scheduling |
| |
| HONG Zong-you,YAN Ping,PANG Ha-li. Study on minimum blocked time algorithm for blocking flow-shop scheduling[J]. Journal of Liaoning Normal University(Natural Science Edition), 2007, 30(2): 148-151 |
| |
| Authors: | HONG Zong-you YAN Ping PANG Ha-li |
| |
| Affiliation: | 1. Department of Sciencc,Shenyang Institute of Chemical Technology, Shenyang 110142, China;2. Institute of Systems Engineering, Northeastern University, Shenyang 110004, China |
| |
| Abstract: | A constructive heuristic algorithm was proposed for Blocking flow-shop scheduling with objective of makespan. The Initial-sequencing priority rule of the proposed algorithm based on the analysis of the critical path of the Gannt and directed graph is to decrease the blocked time of jobs in the sequence, and insertion method was used to determine the optimal sequence. Computational results and comparisons based on benchmarks demonstrated the effectiveness of the proposed algorithm. |
| |
| Keywords: | flow-shop scheduling heuristic Blocking flowshop |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
