| 求解作业排序问题的一种改进修复约束满足算法 |
| |
| 引用本文： | 上官春霞,周泓,师瑞峰,吴旸.求解作业排序问题的一种改进修复约束满足算法[J].控制与决策,2008,23(8). |
| |
| 作者姓名： | 上官春霞 周泓 师瑞峰 吴旸 |
| |
| 作者单位： | 1. 北京航空航天大学,经济管理学院,北京,100191
2. 华北电力大学,自动化系,北京,102206 |
| |
| 基金项目： | 国家自然科学基金，教育部跨世纪优秀人才培养计划 |
| |
| 摘 要： | 修复约束满足算法(修复法)是在完整初始解的基础上不断对变量进行修复,最终得到可行解.对此,提出一种求解flow shop排序问题的改进修复法(IRCS_WT),通过采用新的变量表达方式,设计了一种以启发式优化规则为指导的变量选择算法(LWT),并采用一种变量互换算法(LTEE)保证算法的全局搜索性能.将新算法应用于31个标准算例,与传统算法及遗传算法的优化结果进行比较,结果表明在相同运算时问下改进算法具有明显的优越性.
|
| 关 键 词： | 约束满足 修复法 flow shop排序问题 加权总延误 |
| 收稿时间： | 2007-5-22 |
| 修稿时间： | 2007-10-31 |
Improved repair-based constraint satisfaction method for flow shop scheduling |
| |
| SHANGGUAN Chun-xia,ZHOU Hong,SHI Rui-feng,WU Yang.Improved repair-based constraint satisfaction method for flow shop scheduling[J].Control and Decision,2008,23(8). |
| |
| Authors: | SHANGGUAN Chun-xia ZHOU Hong SHI Rui-feng WU Yang |
| |
| Affiliation: | SHANGGUAN Chun-xia1,ZHOU Hong1,SHI Rui-feng2,WU Yang1(1.School of Economics , Management,Beihang University,Beijing 100191,China,2.Department of Automation,North China Electric Power University,Beijing 102206,China.) |
| |
| Abstract: | Repair-based constraint satisfaction method is one of the two main categories of constraint satisfaction(CS) algorithms.It starts with an arbitrary completed solution,and then resolves conflicts by local repair.An improved repair-based constraint satisfaction(IRCS_WT) method for flow shop scheduling is proposed.In IRCS_WT,a heuristic rule of largest weighted tardiness priority(LWT) is proposed for variables ordering procedure,and a new heuristic of largest tardy and early variables exchanging(LTEE) is desig... |
| |
| Keywords: | Constraint satisfaction Repair-based method Flow shop scheduling Total weighted tardiness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《控制与决策》浏览原始摘要信息 |
|
