| 一类Job-shop多目标优化调度方法 |
| |
| 引用本文： | 曾强,杨育,王小磊,梁学栋.一类Job-shop多目标优化调度方法[J].计算机工程与应用,2010,46(23):215-218. |
| |
| 作者姓名： | 曾强 杨育 王小磊 梁学栋 |
| |
| 作者单位： | 1.重庆大学 机械传动国家重点实验室，重庆 400030 2.河南理工大学，河南 焦作 454000 |
| |
| 基金项目： | 国家自然科学基金，教育部"新世纪优秀人才支持计划" |
| |
| 摘 要： | 提出了一类Job-shop多目标优化调度方法。构建了一个以工件平均流程时间最短、全部工件完工时间最短的Job-shop优化调度模型，并针对模型提出了一种分阶段混合变异的禁忌搜索算法。为增强算法收敛性，利用“逆序变异”和“基因段交换变异”找到了较好的初解，在此基础上利用“基因交换变异”继续搜索近优解。以10个算例验证了提出的Job-shop多目标优化调度方法的正确性和有效性。
|
| 关 键 词： | Job-shop调度 禁忌搜索算法 分阶段混合变异 |
| 收稿时间： | 2009-10-19 |
| 修稿时间： | 2009-12-5
|
Multi-objective optimization method for Job-shop scheduling |
| |
| ZENG Qiang,YANG Yu,WANG Xiao-lei,LIANG Xue-dong.Multi-objective optimization method for Job-shop scheduling[J].Computer Engineering and Applications,2010,46(23):215-218. |
| |
| Authors: | ZENG Qiang YANG Yu WANG Xiao-lei LIANG Xue-dong |
| |
| Affiliation: | 1.State Key Laboratory of Mechanical Transmissions，Chongqing University，Chongqing 400030，China 2.Henan Polytechnic University，Jiaozuo，Henan 454000，China |
| |
| Abstract: | A multi-objective optimization method for Job-shop scheduling is proposed.In the method,an optimal Job-shop scheduling model is established.The objective of the model is to minimize the Average Flow Time（AFT）and overall completion time（makespan） of all workpieces.Aiming at the model,a taboo searching algorithm based on multi-stage hybrid mutation is proposed.To improve the convergence of the algorithm,inverse order mutation and gene segment swap mutation is used to find a good original solution,based on which gene swap mutation is used to find the approximate optimal solution. The algorithm is applied to ten benchmark Job-shop examples,and the result validates the correctness and effectiveness of the optimization method proposed in this paper. |
| |
| Keywords: | Job-shop scheduling taboo searching algorithm multi-stage hybrid mutation |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
