Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/297210 
Year of Publication: 
2023
Citation: 
[Journal:] Logistics Research [ISSN:] 1865-0368 [Volume:] 16 [Issue:] 1 [Article No.:] 6 [Year:] 2023 [Pages:] 1-16
Publisher: 
Bundesvereinigung Logistik (BVL), Bremen
Abstract: 
We present an approximation method for the hybrid flow shop scheduling problem based on relaxation and machine learning techniques. Our model combines a suitable relaxation of the objective function to a continuous solution space with a self-supervised learning method for neural networks, which does not require any labeled training data. Thereby, we avoid the pre-computation of exact solutions, which is generally not feasible for NP-hard problems such as hybrid flow shop scheduling. In terms of computational effort during the decision process, our approach outperforms other methods with similar approximation accuracy, which suggests that the considered technique of self- supervised learning is well suited for high-performance applications involving the approximate optimization of discrete NP-hard problems.
Subjects: 
scheduling
hybrid flow shop
flowtime
makespan
relaxation
neural networks
self- supervised learning
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.