Computing nested reorder intervals for multi-item distribution systems

Computing nested reorder intervals for multi-item distribution systems

0.00 Avg rating0 Votes
Article ID: iaor1991833
Country: United States
Volume: 38
Issue: 1
Start Page Number: 37
End Page Number: 52
Publication Date: Jan 1990
Journal: Operations Research
Authors:
Keywords: distribution
Abstract:

The paper considers 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 heuristics is O(M4L4). The running time to O(MLDlog(ML)) is improved, where D is at most the maximum of the depth of the location and family arborescences.

Reviews

Required fields are marked *. Your email address will not be published.