On the efficiency of optimal algorithms for the joint replenishment problem: a comparative study
2004-08-12
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei200433.pdf, 0.1MB) |
In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and moderate major set-up cost, our algorithm outperforms the latter.
Keywords
Automatically Extracted Terms
- algorithm
- problem
- solution
- number
- replenishment problem
- interval
- wildeman
- vector
- value
- bound
- viswanathan
- function
- set-up cost
- set-up
- replenishment
- method
- vector k
- set-up costs
- porras-wild
- goyal
