Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

References

  • Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990) 36:92–114LinkGoogle Scholar
  • Axsäter S., Rosling K. Multi-level production-inventory control: Material requirements planning or reorder point policies? Euro. J. Oper. Res. (1994) 75:405–412CrossrefGoogle Scholar
  • Bertazzi L., Speranza M. G., Ukovich W. Minimization of logistic costs with given frequencies. Transportation Res. B (1997) 31:327–340CrossrefGoogle Scholar
  • Bramel J., Simchi-Levi D.The Logic of Logistics (1997) (Springer, New York) CrossrefGoogle Scholar
  • Campbell A., Clarke L., Kleywegt A., Savelsbergh M., Crainic T. G., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer Academic Publishers, London, UK) 95–113CrossrefGoogle Scholar
  • Chan L. M. A., Simchi-Levi D. Probabilistic analyses and algorithms for three-level distribution systems. Management Sci. (1998) 44:1562–1576LinkGoogle Scholar
  • Dror M., Ball M. Inventory/routing: Reduction from an annual to a short-period problem. Naval Res. Logist. Quart. (1987) 34:891–905CrossrefGoogle Scholar
  • Federgruen A., Zipkin P. A combined vehicle routing and inventory allocation problem. Oper. Res. (1984) 32:1019–1032LinkGoogle Scholar
  • Hall N. G., Potts C. N. Supply chain scheduling: Batching and delivery. (2000) . Working paper, University of SouthamptonGoogle Scholar
  • Hu T. C.Combinatorial Algorithms (1982) (Addison-Wesley, Reading, MA) Google Scholar
  • Rosenkrantz D. J., Stearns R. E., Lewis P. M. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. (1977) 6:563–581CrossrefGoogle Scholar
  • Thomas D. J., Grifin P. M. Coordinated supply chain management. Euro. J. Oper. Res. (1996) 94:1–15CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.