Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/311058 
Year of Publication: 
2023
Citation: 
[Journal:] Central European Journal of Operations Research [ISSN:] 1613-9178 [Volume:] 32 [Issue:] 3 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2023 [Pages:] 865-896
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
Demand fulfillment and order management are important functions in semiconductor supply chains to interact with customers. In this paper, an iterative short-term demand supply matching (STDSM) algorithm based on mixed-integer linear programming (MILP) is proposed. This approach repromises orders taking into account the finite capacity of the shop floor. Decomposition is used to obtain computationally tractable subproblems. The STDSM approach is applied together with master planning and allocation planning in a rolling horizon setting. A simulation model of a simplified semiconductor supply chain is used for the rolling horizon experiments. The experiments demonstrate that the proposed STDSM scheme outperforms conventional business rule-based heuristics with respect to several delivery performance-related measures and with respect to stability.
Subjects: 
Demand fulfillment
Short-term demand supply matching
Rolling horizon
Semiconductor supply chains
Discrete-event simulation
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





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