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 solution...
Main Author: | Lesnaia, Ekaterina |
---|---|
Format: | Article |
Language: | en_US |
Published: |
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/3751 |
Similar Items
-
Optimizing Safety Stock Placement in General Network Supply Chains
by: Graves, Stephen C., et al.
Published: (2003) -
The Complexity of Safety Stock Placement in General-Network Supply Chains
by: Lesnaia, Ekaterina, et al.
Published: (2005) -
A Decision Framework for Setting an Effective Stock Policy at MedOrg Supply
by: Pua, Arturo Jay
Published: (2016) -
Branch-and bound strategies for dynamic programming
by: Morin, Thomas L., et al.
Published: (2009) -
Branch and bound methods for combinatorial problems.
by: Little, John D. C.
Published: (2009)