| 两阶段流水车间批处理机调度的聚类算法 |
| |
| 引用本文： | 郝尚刚,陈华平,李小林.两阶段流水车间批处理机调度的聚类算法[J].计算机工程,2012,38(14):272-275. |
| |
| 作者姓名： | 郝尚刚 陈华平 李小林 |
| |
| 作者单位： | 1. 中国科学技术大学管理学院,合肥,230026
2. 中国科学技术大学管理学院,合肥230026;中国科学技术大学计算机科学与技术学院,合肥230027 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 针对两阶段流水车间环境下，工件尺寸不同的批处理机调度问题，提出一种以最小化制造期为目标、满足机器容量约束的凝聚聚类调度算法。结合目标函数的特点，利用基于内部和外部2类空间浪费比的变化量定义距离函数，对工件进行分批处理，并使用Johnson规则排序。实验结果表明，在大规模算例情况下，该算法比已有算法更高效，具有更好的鲁棒性。
|
| 关 键 词： | 流水车间 调度算法 批处理机 聚类 空间浪费比 启发式方法 |
| 收稿时间： | 2011-10-07 |
Clustering Algorithm for Two-stage Flow Shop Batch Processor Schedule |
| |
| HAO Shang-gang
,
CHEN Hua-ping
,
LI Xiao-lin.Clustering Algorithm for Two-stage Flow Shop Batch Processor Schedule[J].Computer Engineering,2012,38(14):272-275. |
| |
| Authors: | HAO Shang-gang CHEN Hua-ping LI Xiao-lin |
| |
| Affiliation: | 1(1.School of Management,University of Science and Technology of China,Hefei 230026,China;2.School of Computer Science and Technology,University of Science and Technology of China,Hefei 230027,China) |
| |
| Abstract: | This paper proposes a clustering algorithm to minimize the makespan in a two-stage flow shop with batch processor schedule problem and non-identical job sizes.Considering characteristics of the objective function,the distance function between two batches is defined based on two concepts of internal and external space Waste Ratio(WR).This algorithm is proposed to solve the batching problem by this distance and the sorting problem by Johnson algorithm.Experimental results show that this algorithm is more effective than the existing algorithms,and has better robustness. |
| |
| Keywords: | flow shop schedule algorithm batch processor clustering space Waste Ratio(WR) heuristic method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
