COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 23. pp. 341-344.
|
PDF (COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM)
comparative_study_of_heuristics_for_the__bendaya_isi_a1995re54100009.pdf Download (25kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Subjects: | Systems |
| Department: | College of Computing and Mathematics > lndustrial and Systems Engineering |
| Depositing User: | MR. ATIQ WALIULLAH SIDDIQUI |
| Date Deposited: | 14 Jun 2008 13:16 |
| Last Modified: | 01 Nov 2019 13:44 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/2452 |