Abstract
The multi-item joint replacement 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.
| Original language | English |
|---|---|
| Pages (from-to) | 369-373 |
| Number of pages | 5 |
| Journal | Management Science |
| Volume | 31 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jan 1985 |
| Externally published | Yes |
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research