Sciweavers

Share
COR
2010

A new heuristic to solve the one-warehouse N-retailer problem

9 years 4 months ago
A new heuristic to solve the one-warehouse N-retailer problem
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.
Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin S
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where COR
Authors Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin Sicilia, Andreas Nilsson
Comments (0)
books