Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477513 | European Journal of Operational Research | 2008 | 9 Pages |
Abstract
We consider the replenishment routing problems of one supplier who can replenish only one of multiple retailers per period, while different retailers need different periodical replenishment. For simple cases satisfying certain conditions, we obtain the simple routing by which the supplier can replenish each retailer periodically so that shortage will not occur. For complicated cases, using number theory, especially the Chinese remainder theorem, we present an algorithm to calculate a feasible routing so that the supplier can replenish the selected retailers on the selected periods without shortages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jing-An Li, Yue Wu, Kin Keung Lai, Ke Liu,