.png){kind=icon}
Return
An efficient optimal solution method for the joint replenishment problem with minimum order quantities
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2005.02.056.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We derive bounds on the basic cycle time and we propose an efficient global optimisation procedure to solve the JRP with constraints. Moreover, we also consider the case where a correction is made for empty replenishment occasions. The algorithms are tested with data from a real case and some additional numerical experiments are also presented. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
inventory
joint replenishment
minimum order quantities
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
.png){kind=icon}
