Open AccessComputing Nested Reorder Intervals for Multi-Item Distribution Systems
Author(s) -
R. Roundy
Publication year - 1990
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.38.1.37
Subject(s) - heuristic , computer science , constant (computer programming) , set (abstract data type) , order (exchange) , mathematical optimization , reorder point , distribution (mathematics) , nested set model , mathematics , economic order quantity , data mining , economics , supply chain , mathematical analysis , finance , relational database , political science , law , programming language
We consider a multistage, multi-item distribution system in which each of a number of items is stocked at each of a number of locations. The cost of placing an order at a location depends on the set of items ordered there. Demand for the items is constant, and there is a linear holding cost for each item at each location. Only nested policies are considered. A known heuristic is guaranteed to find a policy that is within 2% of optimal. However, if there are M items and L locations the running time of the heuristic is OM4L4. We improve the running time to OMLD logML where D is at most the maximum of the depth of the location and family arborescences.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom