haku: @author Joneja, D. / yhteensä: 3
viite: 3 / 3
« edellinen | seuraava »
| Tekijä: | Joneja, D. |
| Otsikko: | The joint replenishment problem: new heuristics and worst case performance bounds. |
| Lehti: | Operations Research
1990 : JUL-AUG, VOL. 38:4, p. 711-723 |
| Asiasana: | INVENTORY CONTROL HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The joint replenishment problem concerns the lot sizing of several items. Each item has a fixed ordering costs and a linear inventory holding cost. In addition, a joint ordering cost is incurred whenever one or more are ordered together. This problem arises both in manufacturing and in distribution. An existing heuristic is analyzed. Its worst case performance can be bad. A new heuristic is developed. Its worst case bound is shown to be tight for the heuristic. Furthermore, a lower bound on the cost of the optimum solution is developed once the heuristic has been used. Then a number of related heuristic algorithms and their worst case performance are presented and discussed. |
« edellinen | seuraava »
SCIMA