运筹与管理 ›› 2022, Vol. 31 ›› Issue (1): 87-91.DOI: 10.12005/orms.2022.0013

• 理论分析与方法探讨 • 上一篇    下一篇

离散回溯搜索算法求解多柔性作业车间调度

董海1, 徐晓鹏2   

  1. 1.沈阳大学 应用技术学院,辽宁 沈阳 110044;
    2.大连理工大学 机械工程学院,辽宁 沈阳 110044
  • 收稿日期:2019-07-30 出版日期:2022-01-25 发布日期:2022-02-11
  • 作者简介:董海(1971-),男,山东淄博人,教授,博士,研究方向:先进生产系统建模优化与控制、制造企业物流运作流程优化;徐晓鹏(1991-),男,辽宁沈阳人,硕士研究生,研究方向:先进生产系统建模优化与控制。
  • 基金资助:
    自然科学基金资助项目(71672117)

Solving Multi-flexible Job-shop Scheduling Problem by Discrete Backtracking Search Algorithm

DONG Hai1, XU Xiao-peng2   

  1. 1. School of Applied Technology, Shenyang University, Shenyang 110044, China;
    2. School of Mechanical Engineering. Shenyang University, Shenyang 110044, China
  • Received:2019-07-30 Online:2022-01-25 Published:2022-02-11

摘要: 针对柔性作业车间生产中机器和工序柔性与多能工的存在建立模型,并提出一种整数编码方案和设一种基于Pareto解集的离散回溯搜索算法进行求解。首先,采用精英化历史种群的方法提升历史种群引导当前种群进化的能力;其次,在交叉变异步骤用遗传交叉算子替代回溯搜索算法原有结构;再次,为保留更多较优解到当前种群,结合快速非支配排序方法更新当前种群;最后,求解数值实例,与多种智能算法进行对比,验证算法的可行性和有效性。

关键词: 作业车间调度问题, 多能工, 回溯搜索算法, 快速非支配排序

Abstract: Considering multi-skilled workers and the flexibility of machines and operations, a model is built. An integer coding and a discrete backtracking search algorithm based on Pareto set is proposed. Firstly, a method of improving the historical population is proposed to better guide evolution; secondly, at the mutation and crossover stage, the genetic crossover operators are used to replace the origin algorithm structure in the backtracking search algorithm; thirdly, to ensure better solutions to be retained, the current population is refreshed based on fast non-dominated sorting. Finally, effectiveness and feasibility of the algorithm is tested in a calculation example constructed.

Key words: job-shop scheduling problem, multi-skilled workers, backtracking search algorithm, fast non-dominated sorting

中图分类号: