Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains

dc.contributor.author	Lesnaia, Ekaterina
dc.date.accessioned	2003-11-29T20:42:44Z
dc.date.available	2003-11-29T20:42:44Z
dc.date.issued	2003-01
dc.identifier.uri	http://hdl.handle.net/1721.1/3751
dc.description.abstract	In this paper, we minimize the holding cost of the safety stock in the supply chain subject to linear constraints on the service times between the nodes of the network. In the problem, the objective function is concave as we assume the demand to be bounded by a concave function. The optimal solutions of the problem belong to the set of extreme points of the polyhedron, specified by the constraints of the problem. We first characterize the extreme points for the two-layer networks and then provide bounds to use in a branch and bound algorithm.	en
dc.description.sponsorship	Singapore-MIT Alliance (SMA)	en
dc.format.extent	104685 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.relation.ispartofseries	Innovation in Manufacturing Systems and Technology (IMST);
dc.subject	base-stock policy	en
dc.subject	dynamic programming application	en
dc.subject	multi-stage supply-chain application	en
dc.subject	safety stock optimization	en
dc.subject	branch and bound algorithm	en
dc.title	Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains	en
dc.type	Article	en