The Complexity of Safety Stock Placement in General-Network Supply Chains
Author(s)Lesnaia, Ekaterina; Vasilescu, Iuliu; Graves, Stephen C.
We consider the optimization problem of safety stock placement in a supply chain, as formulated in . We prove that this problem is NP-Hard for supply chains modeled as general acyclic networks. Thus, we do not expect to find a polynomial-time algorithm for safety stock placement for a general-network supply chain.
Innovation in Manufacturing Systems and Technology (IMST);
Complexity, safety stock placement, supply chain planning