In a rapidly changing economy, warehouse location is a dynamic decision problem. Yet most existing location models used to solve the problem are static. In this article, solutions from these static location models are used with the techniques of dynamic programming to find a dynamic optimum warehouse location-relocation plan.
Get full access to this article
View all access options for this article.
References
1.
RonaldH. Ballou, “Inventory Location Theory in Perspective,” Unpublished paper, Graduate School of Business Administration, Northwestern University, November 1967.
RichardE. Bellman, and DreyfusStuart E., Applied Dynamic Programming, Princeton, N. J.: Princeton University Press, 1962.
4.
AlfredA. Kuehn, and HamburgerMichael J., “A Heuristic Program for Locating Warehouses,”Management Science, 9 (July 1963), 643–66.
5.
FrankH. Mossman, and MortonNewton, Logistics of Distribution Systems, Boston: Allyn and Bacon, Inc., 1965.
6.
EdwardW. Smykay, BowersoxDonald J., and MossmanFrank H., Physical Distribution Management, New York: The Macmillan Company, 1961.
7.
RogerC. Vergin, and RogersJack D., “An Algorithm and Computational Procedure for Locating Economic Facilities,”Management Science, 13 (February 1967), B-240–54.
