| dc.creator |
Graves, Stephen C. |
|
| dc.creator |
Lesnaia, Ekaterina |
|
| dc.date |
2003-12-15T12:00:00Z |
|
| dc.date |
2003-12-15T12:00:00Z |
|
| dc.date |
2004-01 |
|
| dc.date.accessioned |
2013-10-09T02:33:10Z |
|
| dc.date.available |
2013-10-09T02:33:10Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/3915 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.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. |
|
| dc.description |
Singapore-MIT Alliance (SMA) |
|
| dc.format |
10654 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
Innovation in Manufacturing Systems and Technology (IMST); |
|
| dc.subject |
safety stock placement |
|
| dc.subject |
supply chains |
|
| dc.subject |
deterministic optimization |
|
| dc.subject |
branch and bound algorithms |
|
| dc.title |
Optimizing Safety Stock Placement in General Network Supply Chains |
|
| dc.type |
Article |
|