约束满足混合算法求解并行机Job-Shop调度问题

约束满足混合算法求解并行机Job-Shop调度问题
李俊芳;李铁克;屈国强
【期刊名称】《计算机应用研究》
【年(卷),期】2011(28)8
【摘要】分析并行机Job-Shop调度问题的特点并建立其约束满足优化模型,结合约束满足与变邻域搜索技术设计了一个求解该问题的混合优化算法.该算法采用变量排序方法和值排序方法选择变量并赋值,利用回溯和约束传播消解资源冲突,生成初始可行调度,然后应用局部搜索技术增强收敛性,并通过结合问题特点设计的邻域结构的多样性提高求解质量.数据实验表明,提出的算法与其他两种算法相比,具有一定的可行性和有效性.%Analyzed the Job-Shop scheduling problem with parallel machines and established its constraint satisfaction optimization model. Proposed a hybrid optimization algorithm combined with constraint satisfaction and variable neighborhood search technique. In the algorithm, chosen a variable and assigned by variable ordering and value ordering method. Resolved resource conflicts using backtracking and obtained constraint propagation technology until a feasible schedule. Then the feasible schedule acted as an initial solution of the variable neighborhood search algorithm. Enhanced the convergence through local search technology and improved the quality of solution through the diversity of the designed neighborhood structures according to the characteristics of the problem. The feasibility and validity of the proposed
hybrid method is demonstrated by the data experiment compared with the other two algorithms.
【总页数】3页(P2822-2824)
【作者】李俊芳;李铁克;屈国强
【作者单位】北京科技大学经济管理学院,北京100083;北京科技大学经济管理学院,北京100083;北京科技大学经济管理学院,北京100083
【正文语种】中文
【中图分类】TP301.6
【相关文献】
1.求解Job-Shop约束满足问题的变量排序算法比较研究 [J], 尹静;李铁克
2.用遗传神经网络混合算法求解可变加工时间Job-shop调度问题 [J], 吴晶晶;蒋文贤;徐克林
3.约束满足混合算法求解提前/拖期Job Shop调度问题 [J], 李俊芳;李铁克;王伟玲
4.用约束满足自适应神经网络和有效的启发式算法解Job-shop调度问题 [J], 杨圣祥;汪定伟
5.用遗传算法解决在并行机上带有不同交货期窗口的Job-Shop调度问题 [J], 童刚;李光泉;刘宝坤
因版权原因，仅展示原文概要，查看原文内容请购买。