An efficient optimal solution method for the joint replenishment problem with minimum order quantities
2003-08-07
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei200352.pdf, 0.5MB) |
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 first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic cycle time and 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 in a real case.
Keywords
Automatically Extracted Terms
- function
- algorithm
- correction factor
- replenishment
- order
- vector
- product
- number
- value
- solution
- bound
- optimisation algorithm
- aj /ai
- procedure
- optimisation
- factor
- replenishment problem
- problem
- correction
- quantity
