*Result*: Deep reinforcement learning for solving hybrid flow shop scheduling problems with limited buffers.
*Further Information*
*The Hybrid Flow Shop Scheduling Problem with Limited Buffers (LBHFSP) is a challenging issue commonly studied in computer science and operations research. In this paper, we propose a neural heuristic based on deep reinforcement learning (DRL) to solve the LBHFSP and its special variant, the Blocking Hybrid Flow Shop Scheduling Problem (BHFSP), using an encoder-decoder structured policy network trained to sequentially construct the processing scheme. To determine the processing relationship between the job, stage, and machine, we design a two-module attention-based architecture. Particularly, the encoder includes a memory module and a mixture module, allowing us to account for the impact of previous stages and integrate the processing time into the decision-making process. The decoder includes a memory module and a mask module, which exploits stored information to select jobs to be processed on the current machine and ensure the feasibility of the solution. Evaluations demonstrate that our neural heuristic performs favourably on randomly generated instances and exhibits strong generalisation capabilities. In real-world data of the excavator production line in Sany Heavy Machinery Ltd., it can improve over 3% compared to actual algorithms, proving that our method remains effective even when the number of machines varies across different stages. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)*