Dynamic Scheduling of Distributed Blocking Flowshop with Machine Breakdowns
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.
国家科技期刊平台
NSTL
万方数据
