Return to search

Optimizing Safety Stock Placement in General Network Supply Chains

In the paper, we minimize the holding cost of the safety stock held in a supply chain modeled as a general network. By our assumption, the demand is bounded by a concave function. This fact allows us to formulate the problem as a deterministic optimization. We minimize a concave function over a discrete polyhedron. The main goal of the paper is to describe an algorithm to solve the problem without assuming any particular structure of the underlying supply chain. The algorithm is a branch and bound algorithm. / Singapore-MIT Alliance (SMA)
Date01 1900
CreatorsGraves, Stephen C., Lesnaia, Ekaterina
Source SetsM.I.T. Theses and Dissertation
Detected LanguageEnglish
Format10654 bytes, application/pdf
RelationInnovation in Manufacturing Systems and Technology (IMST);

Page generated in 0.0023 seconds