Computing Nested Reorder Intervals for Multi-Item Distribution Systems

@article{Roundy1990ComputingNR,
  title={Computing Nested Reorder Intervals for Multi-Item Distribution Systems},
  author={R. Roundy},
  journal={Oper. Res.},
  year={1990},
  volume={38},
  pages={37-52}
}
  • R. Roundy
  • Published 1990
  • Computer Science
  • Oper. Res.
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… Expand
Chapter 2 Analysis of multistage production systems
Shipment Consolidation: Who Pays for It and How Much?
Analysis of Multistage Production Systems
Survey of cooperative inventory games and extensions
Coordination mechanisms of supply chain systems

References

SHOWING 1-10 OF 12 REFERENCES
...
1
2
...