Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots

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, utilizing makespan as feedback. To prevent bli...

Full description

Saved in:
Bibliographic Details
Published in:Complex System Modeling and Simulation Vol. 4; no. 3; pp. 223 - 235
Main Authors: Wang, Ping, De Leone, Renato, Sang, Hongyan
Format: Journal Article
Language:English
Published: Tsinghua University Press 01.09.2024
Subjects:
dynamic search
flowshop sechduling
lot-streaming
q-learning
reward function
ISSN:2096-9929, 2097-3705
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, utilizing makespan as feedback. To prevent blind search, a dynamic ε-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 ε-greedy strategy, the Glover operator complements local search efforts. Simulation experiments, comparing the IDQL algorithm with other intelligent algorithms, validate 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.
ISSN:2096-9929
2097-3705
DOI:10.23919/CSMS.2024.0010