Return to search

Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains

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. / Singapore-MIT Alliance (SMA)

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/3751
Date01 1900
CreatorsLesnaia, Ekaterina
Source SetsM.I.T. Theses and Dissertation
Languageen_US
Detected LanguageEnglish
TypeArticle
Format104685 bytes, application/pdf
RelationInnovation in Manufacturing Systems and Technology (IMST);

Page generated in 0.0021 seconds