haku: @indexterm heuristic methods / yhteensä: 556
viite: 158 / 556
| Tekijä: | Federgruen, A. Tzur, M. |
| Otsikko: | The joint replenishment problem with time-varying costs and demands: efficient, asymptotic and e-optimal solutions |
| Lehti: | Operations Research
1994 : NOV/DEC, VOL. 42:6, p. 1067-1086 |
| Asiasana: | COSTS ECONOMICS HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The authors address the Joint Replenishment Problem (JRP) where, in the presence of joint setup costs, dynamic lot sizing schedules need to be determined for m items over a planning horizon of N periods, with general time-varying cost and demand parameters. The authors develop a new, so-called, partitioning heuristic for this problem, which partitions the complete horizon of N periods into several relatively small intervals, specifies an associated joint replenishment problem for each of these, and solves them via a new , efficient branch-and-bound method. |
SCIMA