Real-time large-scale supplier order assignments across two-tiers of a supply chain with penalty and dual-sourcing
| Autor: | Vinod Kumar Chauhan, Stephen Mak, Ajith Kumar Parlikad, Muhannad Alomari, Linus Casassa, Alexandra Brintrup |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| DOI: | 10.48550/arxiv.2210.11953 |
| Popis: | Supplier selection and order allocation (SSOA) are key strategic decisions in supply chain management which greatly impact the performance of the supply chain. Although, the SSOA problem has been studied extensively but less attention paid to scalability presents a significant gap preventing adoption of SSOA algorithms by industrial practitioners. This paper presents a novel multi-item, multi-supplier double order allocations with dual-sourcing and penalty constraints across two-tiers of a supply chain, resulting in cooperation and in facilitating supplier preferences to work with other suppliers through bidding. We propose Mixed-Integer Programming models for allocations at individual-tiers as well as an integrated allocations. An application to a real-time large-scale case study of a manufacturing company is presented, which is the largest scale studied in terms of supply chain size and number of variables so far in literature. The use case allows us to highlight how problem formulation and implementation can help reduce computational complexity using Mathematical Programming (MP) and Genetic Algorithm (GA) approaches. The results show an interesting observation that MP outperforms GA to solve SSOA. Sensitivity analysis is presented for sourcing strategy, penalty threshold and penalty factor. The developed model was successfully deployed in a large international sourcing conference with multiple bidding rounds, which helped in more than 10% procurement cost reductions to the manufacturing company. Comment: accepted at Computers & Industrial Engineering (2022) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|