A new heuristic to solve the one-warehouse N-retailer problem
2010 (English)In: Computers & Operations Research, ISSN 0305-0548, E-ISSN 1873-765X, Vol. 37, no 2, p. 265-272Article in journal (Refereed) Published
Abstract [en]
We deal with a multi-echelon inventory system in which one warehouse supplies an item to multiple retailers. Customer demand arrives at each retailer at a constant rate. The retailers replenish their inventories from the warehouse that in turn orders from an outside supplier. It is assumed that shortages are not allowed and lead times are negligible. The goal is to determine replenishment policies that minimize the overall cost in the system. We develop a heuristic to compute efficient policies, which also can easily be used in a spreadsheet application. The main idea consists of finding a balance between the replenishment and the inventory holding costs at each installation. This new heuristic we compare with two other approaches proposed in the literature; the computational studies show that in most of the instances generated the new method provides lower costs.
Place, publisher, year, edition, pages
2010. Vol. 37, no 2, p. 265-272
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-10749DOI: 10.1016/j.cor.2009.04.012ISI: 000273416100005Scopus ID: 2-s2.0-69549112879Local ID: 99abae00-3b19-11de-a8ec-000ea68e967bOAI: oai:DiVA.org:ltu-10749DiVA, id: diva2:983696
Note
Validerad; 2010; 20090507 (ysko)
2016-09-292016-09-292018-07-10Bibliographically approved