• CN:11-2187/TH
  • ISSN:0577-6686

机械工程学报 ›› 2026, Vol. 62 ›› Issue (15): 244-261.doi: 10.3901/JME.260551

• 特邀专栏:大模型时代的智能设计与制造 • 上一篇    

扫码分享

考虑预保养的批量流柔性作业车间绿色调度

王玉芳1,2,3, 华晓麟1, 章殿清1, 刘平英1   

  1. 1. 南京信息工程大学自动化学院 南京 210044;
    2. 南京信息工程大学江苏省大气环境与装备技术协同创新中心 南京 210044;
    3. 南京信息工程大学江苏省气象能源利用与控制工程技术研究中心 南京 210044
  • 收稿日期:2025-08-29 修回日期:2026-01-23 发布日期:2026-10-13
  • 作者简介:王玉芳,女,1979年出生,博士,副教授,硕士研究生导师。主要研究方向为车间调度,智能算法。E-mail:wangyufang@nuist.edu.cn;华晓麟,男,1999年出生,硕士研究生。主要研究方向为生产调度,进化算法。E-mail:202212490040@nuist.edu.cn;章殿清,男,1999年出生,硕士研究生。主要研究方向为绿色调度,强化学习算法。E-mail:842101808@qq.com;刘平英(通信作者),1979年出生,硕士,实验师。主要研究方向为工业自动控制技术与算法。E-mail:lpy@nuist.edu.cn
  • 基金资助:
    国家自然科学基金资助项目(51705260)。

Lot Streaming Flexible Job-shop Scheduling with Pre-maintenance

WANG Yufang1,2,3, HUA Xiaolin1, ZHANG Dianqing1, LIU Pingying1   

  1. 1. School of Automation, Nanjing University of Information Science & Technology, Nanjing 210044;
    2. Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology, Nanjing University of Information Science & Technology, Nanjing 210044;
    3. Jiangsu Engineering Research Center on Meteorological Energy Using and Control, Nanjing University of Information Science & Technology, Nanjing 210044
  • Received:2025-08-29 Revised:2026-01-23 Published:2026-10-13

摘要: 考虑到实际生产中订单的批量性、加工模具的频繁切换、工件的运转需求和累计工时对机器能耗的综合影响,将多时间约束和预保养机制纳入批量调度中,构建以最小化完工时间和能耗为目标的批量流柔性作业车间绿色调度模型。通过对持续加工机器进行必要的预保养,有效减少累计工时对机器能耗的动态影响。针对批量调度和预保养特征,提出基于子批划分的Jaya算法,设计了多重优化机制。首先,引入多种基于子批划分的Jaya优化引导机制加快算法收敛速度,增加种群多样性,提高算法的全局搜索能力;其次,设计了基于子批划分的贪婪搜索策略,提高算法的局部寻优能力。最后,提出基于子批数量的禁忌搜索策略,提高算法的进化效率,减少冗余计算的同时对复杂的个体进行多次搜索,扩大搜索空间。通过消融实验验证所提算法的有效性,与其他4篇文献算法在13组拓展算例中进行了对比,验证了所提算法的优越性。

关键词: 柔性作业车间, 多时间约束, 批量调度, 预保养, 子批划分

Abstract: Considering the batch nature of production orders, the frequent need for mold changes during processing, the transportation requirements of workpieces, and the impact of cumulative processing hours on machine energy consumption, a green scheduling model for lot streaming flexible job-shop is developed. This model incorporates multiple temporal constraints and pre-maintenance mechanisms into batch scheduling with the dual objectives of minimizing makespan and energy consumption. By conducting necessary pre-maintenance on the continuous processing machines, the dynamic impact of cumulative working hours on the energy consumption of the machines can be effectively reduced. Based on the characteristics of batch scheduling and pre-maintenance, a Jaya algorithm based on sub-batch division is proposed, and multiple optimization mechanisms are designed. Firstly, various Jaya optimization guidance mechanisms based on sub-batch division are introduced to accelerate the convergence rate, increase population diversity, and enhance the global search capability of the algorithm. Secondly, a greedy search strategy based on sub-batch division is devised to improve the algorithm’s optimization ability and assist in escaping local optima. Finally, a tabu search strategy based on the number of sub-batches is proposed to improve the evolutionary efficiency of the algorithm, reduce redundant calculations, and enable multiple searches of complex individuals, thereby broadening the search space. The effectiveness of the proposed algorithm is confirmed through ablation experiments. Comparative studies with four other algorithms across 13 extended case examples demonstrate the superiority of the proposed approach.

Key words: flexible job-shop scheduling, multiple temporal constraints, batch scheduling, pre-maintenance, sub-batch partition

中图分类号: