An efficient search method for multi-objective flexible job shop scheduling problems
An efficient search method for multi-objective flexible job shop scheduling problems
复制标题
DOI：
10.1007/s10845-008-0216-z
复制
发表时间：
2009-01
影响因子：
8.3
通讯作者：
Lining Xing;Ying-Wu Chen;Ke-Wei Yang
中科院分区：
文献类型：
--
作者：
Lining Xing;Ying-Wu Chen;Ke-Wei Yang
灵活的车间调度在生产管理和组合优化领域都非常重要。由于计算复杂度高，用传统的优化方法很难获得该问题的最优解。在一些经验知识的推动下，本文提出了一种针对多目标灵活作业车间调度问题的有效搜索方法。通过这项工作中提出的工作，我们希望离生成最佳或接近最佳生产计划的自动化系统的最终愿景更近一步。最终实验结果表明，该算法是解决多目标柔性作业车间调度问题的一种可行有效的方法。
Flexible job shop scheduling is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches. Motivated by some empirical knowledge, we propose an efficient search method for the multi-objective flexible job shop scheduling problems in this paper. Through the work presented in this work, we hope to move a step closer to the ultimate vision of an automated system for generating optimal or near-optimal production schedules. The final experimental results have shown that the proposed algorithm is a feasible and effective approach for the multi-objective flexible job shop scheduling problems.