Modern traceability technologies promise to improve supply chain management by simplifying recalls, increasing visibility, or verifying sustainable supplier practices. Initiatives developing traceability technologies - and who hope to make their technologies the industry standard - must choose the least-costly set of firms to target as early adopters. This choice 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 (potentially large) subset of firms in a product's supply chain. We prove that the problem of selecting the least-costly set of early adopters 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 set of early adopters. The algorithm is fixed-parameter tractable in the supply chain network's treewidth, a parameter which we show to be low in real-world supply chain networks. The algorithm also enables us to derive easily-computable bounds on the optimal cost of selecting early adopters as well as key managerial insights about which type of firm to select.
翻译:现代可追踪技术通过简化召回、提高可见度或核查可持续供应商做法,有望改善供应链管理; 开发可追踪技术的举措――希望将其技术变成行业标准的人――必须选择成本最低的公司作为早期采用者的目标; 这种选择具有挑战性,因为公司是供应链的一部分,在复杂的网络中相互联系,产生固有的供应链效应:从可追踪中获得的好处取决于产品供应链中一个(潜在的大)公司子公司采用技术。 我们证明,在供应链网络中选择成本最低的早期采用者很难解决,甚至难以在多元因素中接近。 然而,我们提供了一种新的线性线性编程算法,以确定成本最低的早期采用者。这种算法可以在供应链网络的树枝中可移动,在现实世界供应链网络中,这种参数我们显示是低的。 算法还使我们能够在选择早期采用者的最佳成本上获得容易理解的界限,以及作为选择哪类公司的关键管理见解。