DSpace Repository

Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains

Show simple item record

dc.creator Lesnaia, Ekaterina
dc.date 2003-11-29T20:42:44Z
dc.date 2003-11-29T20:42:44Z
dc.date 2003-01
dc.date.accessioned 2013-10-09T02:32:20Z
dc.date.available 2013-10-09T02:32:20Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/3751
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description 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.
dc.description Singapore-MIT Alliance (SMA)
dc.format 104685 bytes
dc.format application/pdf
dc.language en_US
dc.relation Innovation in Manufacturing Systems and Technology (IMST);
dc.subject base-stock policy
dc.subject dynamic programming application
dc.subject multi-stage supply-chain application
dc.subject safety stock optimization
dc.subject branch and bound algorithm
dc.title Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains
dc.type Article

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account