Abstract
AbstractDemand 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.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference53 articles.
1. Albey E, Norouzi A, Kempf K, Uzsoy R (2015) Demand modeling with forecast evolution: an application to production planning. IEEE Trans Semicond Manuf 28(3):374–384
2. Alemany MME, Ortiz A, Fuertes-Miquel VS (2018) A decision support tool for the order promising process with product homogeneity requirements in hybrid make-to-stock and make-to-order environments. Applications to a ceramic tile company. Comput Ind Eng 122:219–234
3. Azevedo RC, Amours SD, Rönnqvist M (2016) Advances in profit-driven order promising for make-to-stock environments—a case study with a Canadian softwood lumber manufacturer. INFOR Inf Syst Oper Res 54(3):210–233
4. Babarogić S, Makajić-Nikolić D, Lečić-Cvetković D, Atanasov N (2012) Multi-period customer service level maximization under limited production capacity. Int J Comput Commun Control 7(5):798–806
5. Brahimi N, Aouam T, Aghezzaf EH (2015) Integrating order acceptance decisions with flexible due dates in a production planning model with load-dependent lead times. Int J Prod Res 53:3810–3822
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献