Abstract
In this paper, we compare recent efficient heuristics proposed for solving the joint replenishment problem. A heuristic based on the relaxation of a nonlinear programming formulation of the problem proposed by Hariga is the most efficient heuristic for solving the joint replenishment problem in view of its speed and quality of solution.
| Original language | English |
|---|---|
| Pages (from-to) | 341-344 |
| Number of pages | 4 |
| Journal | Omega |
| Volume | 23 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 1995 |
Keywords
- heuristic
- inventory
- joint replenishment
- multi-item
- simulation
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Information Systems and Management
Fingerprint
Dive into the research topics of 'Comparative study of heuristics for the joint replenishment problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver