The Complexity of Safety Stock Placement in General-Network Supply Chains
| Data(s) |
26/01/2005
26/01/2005
01/01/2005
|
|---|---|
| Resumo |
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. Singapore-MIT Alliance (SMA) |
| Formato |
99232 bytes application/pdf |
| Identificador | |
| Idioma(s) |
en |
| Relação |
Innovation in Manufacturing Systems and Technology (IMST); |
| Palavras-Chave | #Complexity #safety stock placement #supply chain planning |
| Tipo |
Article |
