The Complexity of Safety Stock Placement in General-Network Supply Chains

dc.contributor.author	Lesnaia, Ekaterina
dc.contributor.author	Vasilescu, Iuliu
dc.contributor.author	Graves, Stephen C.
dc.date.accessioned	2005-01-26T13:18:30Z
dc.date.available	2005-01-26T13:18:30Z
dc.date.issued	2005-01
dc.identifier.uri	http://hdl.handle.net/1721.1/7537
dc.description.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.	en
dc.description.sponsorship	Singapore-MIT Alliance (SMA)	en
dc.format.extent	99232 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.relation.ispartofseries	Innovation in Manufacturing Systems and Technology (IMST);
dc.subject	Complexity	en
dc.subject	safety stock placement	en
dc.subject	supply chain planning	en
dc.title	The Complexity of Safety Stock Placement in General-Network Supply Chains	en
dc.type	Article	en