Abstract
Silver’s algorithm for the joint replenishment problem is modified and improved. Computational requirements due to this modification are relatively very small. Extensive experimentation shows that the errors of Silver’s algorithm can, on the average, be reduced by an order of magnitude.
| Original language | English |
|---|---|
| Pages (from-to) | 264-267 |
| Number of pages | 4 |
| Journal | IIE Transactions (Institute of Industrial Engineers) |
| Volume | 15 |
| Issue number | 3 |
| DOIs |
|
| State | Published - 1 Jan 1983 |