期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots
1
作者 Ping Wang Renato De Leone Hongyan Sang 《Complex System Modeling and Simulation》 EI 2024年第3期223-235,共13页
The lot-streaming flowshop scheduling problem with equal-size sublots(ELFSP)is a significant extension of the classic flowshop scheduling problem,focusing on optimize makespan.In response,an improved dynamic Q-learnin... The lot-streaming flowshop scheduling problem with equal-size sublots(ELFSP)is a significant extension of the classic flowshop scheduling problem,focusing on optimize makespan.In response,an improved dynamic Q-learning(IDQL)algorithm is proposed,tillizing makespan as feedback.To prevent blind search,a dynamic 8-greedy search strategy is introduced.Additionally,the Nawaz-Enscore-Ham(NEH)algorithm is employed to diversify solution sets,enhancing local optimality.Addressing the limitations of the dynamic 8-greedy strategy,the Glover operator complements local search efforts.Simulation experiments,comparing the IDQL algorithm with other itelligent algorithms,valldate its effectiveness.The performance of the IDQL algorithm surpasses that of its counterparts,as evidenced by the experimental analysis.Overall,the proposed approach offers a promising solution to the complex ELFSP,showcasing its capability to efficiently minimize makespan and optimize scheduling processes in flowshop environments with equal-size sublots. 展开更多
关键词 lot-streaming flowshop sechduling Q-earning dynamic search reward function
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部