Bendaya, M. and HARIGA, M COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 23. pp. 341-344.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF (COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM) 25Kb |
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 |
|---|---|
| Date Type: | Publication |
| Subjects: | Systems |
| Divisions: | College Of Computer Sciences and Engineering > Systems Engineering Dept |
| Creators: | Bendaya, M. and HARIGA, M |
| Email: | bendaya@kfupm.edu.sa, UNSPECIFIED |
| ID Code: | 2452 |
| Deposited By: | MR. ATIQ WALIULLAH SIDDIQUI |
| Deposited On: | 14 Jun 2008 16:16 |
| Last Modified: | 12 Apr 2011 13:13 |
Repository Staff Only: item control page