.png){kind=icon}
.png){kind=icon}
Return
An efficient optimal solution method for the joint replenishment problem
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(96)00072-0.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
During the last two decades, many heuristic procedures for the joint replenishment problem have appeared in the literature. The only available optimal solution procedure was based on an enumerative approach and was computationally prohibitive. In this paper we present an alternative optimal approach based on global optimisation theory. By applying Lipschitz optimisation one can find a solution with an arbitrarily small deviation from an optimal value. An efficient procedure is presented which uses a dynamic Lipschitz constant and generates a solution in little time. The running time of this procedure grows only linearly in the number of items. (C) 1997 Elsevier Science B.V.
Keywords:
inventory
joint replenishment
multi-item
global optimisation
Lipschitz optimisation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available