The Complexity of Safety Stock Placement in General-Network Supply Chains
Name
IMST033.pdf
Size
96.91 KB
Format
Adobe PDF
Checksum (MD5)
c40f8a577860c7b4acddb8ecf7994dd4
Author(s)
Lesnaia, Ekaterina
Vasilescu, Iuliu
Graves, Stephen C.
Date Issued
January 2005
Series/Report no.
Innovation in Manufacturing Systems and Technology (IMST);
Abstract
We consider the optimization problem of safety stock placement in a supply chain, as formulated in [1]. 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.
Subjects
Complexity
safety stock placement
supply chain planning
Persistent DSpace Link
