Note---A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions

The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for partitioning the items into groups, each with its own fixed cycle time, resulting in an optimal fixed cycle replenishment policy.

MoreLess

Year of publication:	1985
Authors:	Rosenblatt, Meir J. ; Kaspi, Moshe
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 31.1985, 3, p. 369-373
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	dynamic programming: applications \| inventory/production: deterministic models

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.31.3.369 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10009214860