考虑机器故障的分布式阻塞流水车间动态调度研究
Dynamic Scheduling of Distributed Blocking Flowshop with Machine Breakdowns
张晓辉 1梁梦梦 1任文馨 1韩玉艳 2闻东东 1韩冰1
作者信息
- 1. 徐州工程学院 电气与控制工程学院,江苏 徐州 221018
- 2. 聊城大学 计算机学院, 山东 聊城 252000
- 折叠
摘要
以随机机床故障为扰动因素,研究了事件驱动的分布式流水车间动态调度问题.首先,模拟了故障触发与修复机制,提出了动态调度策略,以最大完工时间和系统稳定性为优化目标,构建了分布式流水车间干扰管理模型,给出了分布式流水车间制造模式下的动态调度策略;其次,针对重调度工件设计了改进果蝇优化算法:在初始化阶段,IFOA设计了基于工件权重位置的种群初始化策略;随后,引入差分进化思想对重调度的目标空间进行邻域搜索;之后,提出了基于工件块的随机参考局部搜索策略,提高解得多样性,避免算法陷入局部最优;最后,在不同规模测例上,通过对比主流算法验证了IFOA算法的有效性和优越性.
Abstract
Taking the random machine breakdown as a disturbance factor,this paper studies the event driven distributed blocking flow shop scheduling problem(DBFSP).Firstly,the breakdown triggering and repair mechanism is simulated,and a dynamic scheduling strategy is proposed for DBFSP-MB.Taking the maximum completion time and system stability as both optimization objectives,a distributed congestion flow shop interference management model is constructed;Secondly,a discrete Memetic Algorithm based on differential evolution(IFOA)is designed for the rescheduling jobs:in the initialization phase,IFOA designs a population initialization strategy based on the weighted position of jobs;in the neighborhood search phase,the idea of differential evolution is introduced to explore the rescheduled target space;Then,a random reference local search strategy based on job block is proposed to improve the diversity of solutions and avoid the algorithm falling into local optimum.Finally,on different scale test cases,the effectiveness and superiority of IFOA are verified by comparing with the mainstream algorithms.
关键词
阻塞/机床故障/分布式制造/最大完工时间Key words
flowshop scheduling problem/makespan/machine breakdown引用本文复制引用
出版年
2024
国家科技期刊平台
NSTL
万方数据