Additive manufacturing capacity allocation problem over a network

Basit Öğe Kaydı
dc.authoridJin, Mingzhou/0000-0002-2387-8129
dc.authoridCokyasar, Taner/0000-0001-9687-6725
dc.contributor.authorCokyasar, Taner
dc.contributor.authorJin, Mingzhou
dc.date.accessioned2025-03-17T12:25:44Z
dc.date.available2025-03-17T12:25:44Z
dc.date.issued2023
dc.departmentTarsus Üniversitesi
dc.description.abstractThe use of Additive Manufacturing (AM) for low demand volumes, such as spare parts, has recently attracted considerable attention from researchers and practitioners. This study defines the AM Capacity Allocation Problem (AMCAP) to design an AM supply network and choose between printing upon demand and sourcing through an alternative option for each part in a given set. A mixed-integer nonlinear program was developed to minimize the production, transportation, alternative sourcing, and lead time costs. We developed a cut generation algorithm to find optimal solutions in finite iterations by exploring the convexity of the nonlinear waiting time for AM products at each AM facility. Numerical experiments show the effectiveness of the proposed algorithm for the AMCAP. A case study was conducted to demonstrate that the optimal AM deployment can save almost 20% of costs over situations that do not use any AM. The case also shows that AM can realize its maximum benefits when it works in conjunction with an alternative option, e.g., inventory holding, and its capacity is strategically deployed. Since AM is a new technology and is rapidly evolving, this study includes a sensitivity analysis to see the effects of improved AM technology features, such as machine cost and build speed. When the build speed increases, the total cost decreases quickly, but the number of AM machines will increase first then decrease later when more parts are assigned to the AM option.
dc.identifier.doi10.1080/24725854.2022.2120222
dc.identifier.endpage820
dc.identifier.issn2472-5854
dc.identifier.issn2472-5862
dc.identifier.issue8
dc.identifier.scopus2-s2.0-85139605936
dc.identifier.scopusqualityQ2
dc.identifier.startpage807
dc.identifier.urihttps://doi.org/10.1080/24725854.2022.2120222
dc.identifier.urihttps://hdl.handle.net/20.500.13099/1841
dc.identifier.volume55
dc.identifier.wosWOS:000865055600001
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherTaylor & Francis Inc
dc.relation.ispartofIise Transactions
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20250316
dc.subjectAdditive manufacturing
dc.subjectcapacity planning
dc.subjectnetwork optimization
dc.subjectmixed-integer nonlinear programming
dc.titleAdditive manufacturing capacity allocation problem over a network
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu