DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS.

Meir J. Rosenblatt; Moshe Kaspi

doi:10.1287/mnsc.31.3.369

DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS.

Meir J. Rosenblatt
, Moshe Kaspi

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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	https://doi.org/10.1287/mnsc.31.3.369
State	Published - 1 Jan 1985
Externally published	Yes

ASJC Scopus subject areas

Strategy and Management
Management Science and Operations Research

Access to Document

10.1287/mnsc.31.3.369

Cite this

@article{60e8ae3b358c41f58e66339a67620e30,

title = "DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS.",

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.",

author = "Rosenblatt, \{Meir J.\} and Moshe Kaspi",

year = "1985",

month = jan,

day = "1",

doi = "10.1287/mnsc.31.3.369",

language = "English",

volume = "31",

pages = "369--373",

journal = "Management Science",

issn = "0025-1909",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "3",

}

TY - JOUR

T1 - DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS.

AU - Rosenblatt, Meir J.

AU - Kaspi, Moshe

PY - 1985/1/1

Y1 - 1985/1/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0022028064

U2 - 10.1287/mnsc.31.3.369

DO - 10.1287/mnsc.31.3.369

M3 - Article

AN - SCOPUS:0022028064

SN - 0025-1909

VL - 31

SP - 369

EP - 373

JO - Management Science

JF - Management Science

IS - 3

ER -

DYNAMIC PROGRAMMING ALGORITHM FOR JOINT REPLENISHMENT UNDER GENERAL ORDER COST FUNCTIONS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this