Article Abstract:
The stated problem is that one warehouse supplying a fixed number of retailers with constant demand and no tolerance for inventory shortages must meet demand while minimizing long-range average inventory costs over an infinite time horizon. The inventory costs involved are defined as linear holding costs and fixed ordering costs incurred by both the warehouse-supplier and the retailers-purchasers. The solution offered is purported to be simpler than similar solutions already available in research literature, and therefore easier to compute and implement. The cost of the given solution is shown to be within 2 percent, at worst, of the cost of the optimal policy.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Mathematical models and algorithms are used to simulate a multi-item, one-warehouse, multi-retailer shipment and distribution problem. The model takes into account positive echelon holding costs, fixed ordering and shipping costs, and a fixed joint item order cost at each retailer. Constant demand at a continuous rate is assumed, as is a stationary nested policy. An algorithm based on sorting only operates in 0(NI log NI) time. The computed cost runs within 6% of the optimal stationary nested policy.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Scheduling multi-machine facilities that produce different items can be complex when one or more items are consumed in production. An important production goal is to minimize the average setup and holding cost of items over an infinite time horizon. An effective reorder policy can be calculated with an algorithm that rounds off reorder intervals under the Divide and Conquer algorithm's capacitated version for use in lot sizing multi-stage production/inventory problems.
User Contributions:
Comment about this article or add new information about this topic: