一种增强灰狼算法求解柔性车间动态调度问题

  • 打印
  • 收藏
收藏成功


打开文本图片集

关键词:柔性车间调度问题;动态调度;灰狼算法;关键路径

中图分类号:TP301.6 文献标志码:A 文章编号:1001-3695(2026)01-024-0201-07

doi:10.19734/j. issn.1001-3695.2025.04.0153

Enhanced gray wolf algorithm for solving flexible job-shop dynamic scheduling problems

Chen Xuefen,YeChunming†,An Xicai,Liu Zijun,Zhang Shuman,Yan Jinhui,Tang Tianyu (BusinessSchool,University ofShanghai for Scienceand Technology,Shanghai2Ooo93,China)

Abstract:Inorder tosolvethe problemof dynamicschedulingofflexible workshops under machine failureandurgentorders, thispaperdesignedanenhancedgraywolfalgorithmtominimizethelatestcompletiontimeof themachine.Itdesigneddynamic pre-decoding anddynamic post-decoding,andoptimizedthedecodingprocessbyscheme segmentationandcoding splicing.In termsof thealgorithm,itaddedtheconvergencefactor,theheadwolfoptimizationandtheneighborhoodoptimizationof the critical path toefectivelyavoidfaling intothelocaloptimumandimprovethealgorithmsearchabilityIntermsofalgorithm verification:itselectedmultipleclasicexamplesforstaticsolutiontoobtaintheinitialsolution,anditsimulatedthesolution fordynamic eventsand then dynamicallyoptimized.Theresultsshowthatamong the three rescheduling methods,,theright shiftrescheduling hasthehighestrobustnessandthecompletereschedulinghasthebestoptimizationefect.Compared withits ownvariant algorithmandother mainstream schedulingalgorithms,theenhancedgraywolf algorithmhasgoodperformance in optimizationresultsanditerationtime,andevenhasalowercompletiontimethantheinitialsolution.Ingeneral,theptimizationresultsshow that thedynamic problem issolvedverywellandquickly,andtheenhancedgraywolfalgorithm is feasible and efficient,which is a new and effective solution to this type of problem.

Key words:flexible shop scheduling problem;dynamic scheduling;grey wolf algorithm;critical path

0 引言

作业车间的动态调度是Jackson[1]在1957年提出的概念,动态事件具有发生时间、影响机器、恢复时间不确定等特点。(剩余14614字)

目录
monitor
客服机器人