Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3751| Title: | Optimizing Strategic Safety Stock Placement in Two-Layer Supply Chains |
| Keywords: | base-stock policy dynamic programming application multi-stage supply-chain application safety stock optimization branch and bound algorithm |
| Issue Date: | 9-Oct-2013 |
| 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. Singapore-MIT Alliance (SMA) |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3751 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.