Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3915| Title: | Optimizing Safety Stock Placement in General Network Supply Chains |
| Keywords: | safety stock placement supply chains deterministic optimization branch and bound algorithms |
| Issue Date: | 9-Oct-2013 |
| Description: | 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) |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3915 |
| 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.