可追溯性
供应链
业务
供应链管理
风险分析(工程)
计算机科学
营销
软件工程
作者
Philippe Blaettchen,Andre Calmon,Georgina Hall
出处
期刊:Management Science
[Institute for Operations Research and the Management Sciences]
日期:2024-03-25
被引量:3
标识
DOI:10.1287/mnsc.2022.01759
摘要
Modern traceability technologies promise to improve supply chain management by simplifying recalls, increasing visibility, and verifying sustainable supplier practices. Initiatives leading the implementation of traceability technologies must choose the least-costly set of firms—or seed set—to target for early adoption. Choosing this seed set is challenging because firms are part of supply chains interlinked in complex networks, yielding an inherent supply chain effect: benefits obtained from traceability are conditional on technology adoption by a subset of firms in a product’s supply chain. We prove that the problem of selecting the least-costly seed set in a supply chain network is hard to solve and even approximate within a polylogarithmic factor. Nevertheless, we provide a novel linear programming-based algorithm to identify the least-costly seed set. The algorithm is fixed-parameter tractable in the supply chain network’s treewidth, which we show to be low in real-world supply chain networks. The algorithm also enables us to derive easily computable bounds on the cost of selecting an optimal seed set. We leverage our toolbox to conduct large-scale numerical experiments that provide insights into how the supply chain network structure influences diffusion. These insights can help managers optimize their technology diffusion strategy. This paper was accepted by Chung Piaw Teo, optimization. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2022.01759 .
科研通智能强力驱动
Strongly Powered by AbleSci AI