Title of article
A newheuristictosolvetheone-warehouse N-retailer problem
Author/Authors
Beatriz Abdul-Jalbar، نويسنده , , AndersSegerstedtb، نويسنده , , Joaqu?nSicilia، نويسنده , , AndreasNilsson، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
8
From page
265
To page
272
Abstract
We dealwithamulti-echeloninventorysysteminwhichonewarehousesuppliesanitemtomultiple
retailers. Customerdemandarrivesateachretailerataconstantrate.Theretailersreplenishtheirin-
ventories fromthewarehousethatinturnordersfromanoutsidesupplier.Itisassumedthatshortages
are notallowedandleadtimesarenegligible.Thegoalistodeterminereplenishmentpoliciesthat
minimize theoverallcostinthesystem.Wedevelopaheuristictocomputeefficientpolicies,whichalso
can easilybeusedinaspreadsheetapplication.Themainideaconsistsoffindingabalancebetweenthe
replenishment andtheinventoryholdingcostsateachinstallation.Thisnewheuristicwecomparewith
two otherapproachesproposedintheliterature;thecomputationalstudiesshowthatinmostofthe
instances generatedthenewmethodprovideslowercosts.
Keywords
Supply chain management , Two-echelon inventory system , Integer-ratio policies
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927642
Link To Document