现代制造工程 ›› 2026, Vol. 544 ›› Issue (1): 1-14.doi: 10.16731/j.cnki.1671-3133.2026.01.001

• 先进制造系统管理运作 •    下一篇

考虑夹具的双资源约束柔性作业车间调度研究*

葛师语1, 王玉芳1,2,3, 张毅1, 华晓麟1   

  1. 1 南京信息工程大学自动化学院,南京 210044;
    2 南京信息工程大学江苏省大气环境与装备技术协同创新中心,南京 210044;
    3 南京信息工程大学江苏省气象能源利用与控制工程技术研究中心,南京 210044
  • 收稿日期:2024-12-30 出版日期:2026-01-18 发布日期:2026-03-17
  • 通讯作者: 王玉芳,博士,副教授,主要研究方向为生产调度、智能优化算法及绿色制造。E-mail:wangyufang@nuist.edu.cn
  • 作者简介:葛师语,硕士研究生,主要研究方向为车间调度、智能优化算法。
  • 基金资助:
    *国家自然科学基金项目(51705260)

Research of dual resource constrained flexible job-shop scheduling considering fixtures

GE Shiyu1, WANG Yufang1,2,3, ZHANG Yi1, HUA Xiaolin1   

  1. 1 School of Automation, Nanjing University of Information Science & Technology, Nanjing 210044, China;
    2 Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology, Nanjing University of Information Science & Technology, Nanjing 210044, China;
    3 Jiangsu Engineering Research Center on Meteorological Energy Using and Control, Nanjing University of Information Science & Technology, Nanjing 210044, China
  • Received:2024-12-30 Online:2026-01-18 Published:2026-03-17

摘要: 考虑工件加工需要夹具固定以及夹具切换所产生的设置时间,以最小化最大完工时间为优化目标构建考虑夹具的双资源约束柔性作业车间调度模型,并提出了一种自适应大邻域搜索遗传算法求解该问题。为提高算法的进化起点,设计了一种两阶段初始化策略,提高初始种群的质量,加快算法的收敛速度。考虑夹具的频繁切换,设计多种邻域结构进行局部搜索,减少夹具切换的设置时间,从而减小最大完工时间。为了减少冗余计算,设计自适应大邻域搜索策略,针对性地选取邻域结构,提高算法的进化效率,加快算法的收敛速度。通过消融实验验证改进策略的有效性,与4种类似问题的算法在测试算例中进行对比,验证该算法的优越性。

关键词: 夹具切换, 设置时间, 柔性作业车间调度, 自适应大邻域搜索遗传算法

Abstract: Considering the need for fixtures to secure work pieces during processing period and the setup time caused by fixture changes,an optimization model for flexible job-shop scheduling with dual resource constraints considering fixtures is constructed, aiming to minimize the maximum completion time. An adaptive large neighborhood search genetic algorithm is proposed to solve this problem. To improve the evolutionary starting point of the algorithm, a two-stage initialization strategy is designed, enhancing the quality of the initial population and accelerating the convergence speed of the algorithm. In view of frequent fixture changes, multiple neighborhood structures are designed for local search to reduce the setup time of fixture changes, thereby reducing the maximum completion time. To minimize redundant calculations, an adaptive large neighborhood search strategy is designed to selectively choose neighborhood structures, improving the evolutionary efficiency of the algorithm and accelerating its convergence rate. The effectiveness of the improved strategies is verified through ablation experiments, and the superiority of the proposed algorithm is demonstrated by comparing it with four similar algorithms on test instances.

Key words: fixture changes, setup time, flexible job-shop scheduling, adaptive large neighborhood search genetic algorithm

中图分类号: 

版权所有 © 《现代制造工程》编辑部 
地址:北京市东城区东四块玉南街28号 邮编:100061 电话:010-67126028 电子信箱:2645173083@qq.com
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn