Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483304 | European Journal of Operational Research | 2006 | 21 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Eric Porras, Rommert Dekker,