COMPARATIVE-STUDY OF HEURISTICS FOR THE JOINT REPLENISHMENT PROBLEM
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...
Saved in:
| Main Author: | Bendaya, M. (author) |
|---|---|
| Other Authors: | HARIGA, M (author), unknown (author) |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2452/1/comparative_study_of_heuristics_for_the__bendaya_isi_a1995re54100009.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The examination of self-service replenishing solutions' potential
by: Farah, Maya F.
Published: (2020) -
The Joint Economic Lot Sizing Problem: Review And Extensions
by: Darwish, M.
Published: (2020) -
Meta-Heuristic Procedures for the Multi-Resource Leveling Problem with Activity Splitting
by: AlSayegh, Hadeel Yacoub
Published: (2011) -
An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem
by: Bendaya, M.
Published: (2020) -
A comparison of optimization heuristics for the data mapping problem
by: Mansour, Nashat
Published: (1997)