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)
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/7537 |
| Date | 01 1900 |
| Creators | Lesnaia, Ekaterina, Vasilescu, Iuliu, Graves, Stephen C. |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Article |
| Format | 99232 bytes, application/pdf |
| Relation | Innovation in Manufacturing Systems and Technology (IMST); |
Page generated in 0.0025 seconds