Competitive Analysis of the Online Inventory Problem

Kim Skak Larsen, Sanne Wøhlk

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

We consider a real-time version of the inventory problem with deterministic demand in which decisions as to when to replenish and how much to buy must be made in an online fashion without knowledge of future prices. We suggest online algorithms for each of four models for the problem and use competitive analysis to obtain algorithmic upper and lower bounds on the worst-case performance of the algorithms compared to an optimal offline algorithm. These bounds are closely related to the tight kvadratroden af M/m-bound obtained for the simplest of the models, where M and m are the upper and lower bounds on the price fluctuation.
OriginalsprogEngelsk
TidsskriftEuropean Journal of Operational Research
Vol/bind207
Udgave nummer2
Sider (fra-til)685-696
ISSN0377-2217
DOI
StatusUdgivet - 2010

Fingeraftryk Dyk ned i forskningsemnerne om 'Competitive Analysis of the Online Inventory Problem'. Sammen danner de et unikt fingeraftryk.

  • Citationsformater