Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future

Naval Research Logistics

Volumn 43, Issue 2, 1996, Pages 169-189

  Federgruen, Awi ^a   Tzur, Michal ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010308499     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199603)43:2<169::AID-NAV2>3.0.CO;2-8     Document Type: Article

References (57)

1. Abdul-Razaq, T.S., and Potts, C.N., "Dynamic Programming State-Space Relaxation for Single-Machine Scheduling," Journal of Operational Research Society, 39, 141-152 (1988).
2. Anily, S., and Federgruen, A., "One Warehouse Multiple Retailer Systems with Vehicle Routing Costs," Management Science, 36, 92-114 (1990).
3. Anily, S., and Federgruen, A., "Two Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories," Operations Research, 41, 37-47 (1993).
4. Arkin, E., Joneja, D., and Roundy, R., "Computational Complexity of Uncapacitated Multi-Echelon Production Planning Problems," Operations Research Letters, 8, 61-66 (1989).
5. Atkins, D.R., and lyogun, P.O., "A Heuristic with Lower Bound Performance Guarantee for the Multi-Product Dynamic Lot-Size Problem," IIE Transactions, 20, 369-373 (1988).
6. Bean, J.C., and Smith, R.L., "Condition for the Existence of Planning Horizons," Mathematics of Operations Research, 9, 391-401 (1984).
7. Bean, J., and Smith, R., "Conditions for the Discovery of Solution Horizons," Mathematical Programming, 59, 215-229 (1993).
8. Bensoussan, A., Crouhy, J., and Proth, J.M., "Mathematical Theory of Production Planning," In Advanced Series in Management, North-Holland, Amsterdam, 1983.
9. Bensoussan, A., Proth, J.M., and Queyranne, M., "A Planning Horizon Algorithm for Deterministic Inventory Management with Piecewise Linear Concave Costs," Naval Research Logistics, 38, 729-742 (1991).
10. Bertsimas, D., and Van Ryzin, G., "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, 39, 601-615 (1991).
11. Bertsimas, D., and Van Ryzin, G., "Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles," Operations Research, 41, 60-76 (1993).
12. Bes, C., and Sethi, S., "Concepts of Forecast Horizons and Decision Horizons: Applications to Dynamic Stochastic Optimization Problems," Mathematics of Operations Research, 13, 295-310 (1988).
13. Bramel, J., and Simchi-Levi, D., "A Location Based Heuristic for General Routing Problems," Working Paper, Columbia University (1992).
14. Carlson, R.C., Beckerman, S.L., and Kropp, D.H., "The Effectiveness of Extending the Horizon in Rolling Production Scheduling," Decision Sciences, 13, 129-146 (1982).
15. Carlson, R.C., Jucker, J.V., and Kropp, D.H., "Less Nervous MRP Systems: A Dynamic Economic Lot-Sizing Approach," Management Science, 25, 754-761 (1979).
16. Carlson, R.C., Jucker, J.V., and Kropp, D.H., "Heuristic Lot Sizing Approaches for Dealing with MRP Systems Nervousness," Decision Sciences, 14, 156-169 (1983).
17. Chand, S., "Lot-Sizing for Products with Finite Demand Horizon and Periodic Review Policy," European Journal of Operational Research, 11, 145-148 (1982).
18. Chand, S., and Morton, T.E., "A Perfect Planning Horizon for a Deterministic Cash Balance Problem," Management Science, 28, 652-669 (1982).
19. Chand, S., and Morton, T.E., "Minimal Forecast Horizon Procedures for Dynamic Lot Size Models," Naval Research Logistics Quarterly, 33, 111-122 (1986).
20. Chand, S., and Sethi, S., "Planning Horizon Procedures for Machine Replacement Models with Several Possible Replacement Alternatives," Naval Research Logistics, 29, 483-493 (1982).
21. Chand, S., and Sethi, S., "A Dynamic Lot Sizing Model with Learning in Setups," Operations Research, 38, 644-655 (1990).
22. Chand, S., Sethi, S., and Proth, J.M., "Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Model," Operations Research, 38, 884-892 (1990).
23. Chand, S., Sethi, S., and Sorger, G., "Forecast Horizons in the Discounted Dynamic Lot Size Model," Management Science, 38, 1034-1048 (1992).
24. Christofides, N., Mingozzi, A., and Toth, P., "State-Space Relaxation Procedure for Computation of Bounds to Routing Problems," Networks, 11, 145-164 (1981).
25. Coffman, E.G., Yannakakis, M., Magazine, M.J., and Santos, C., "Batch Sizing and Job Sequencing on a Single Machine," Annals of Operations Research, 26, 135-147 (1990).
26. Eppen, G.D., Gould, F.J., and Pashigian, B.P., "Extensions of Planning Horizon Theorem in the Dynamic Lot Size Model," Management Science, 15, 268-277 (1969).
27. Federgruen, A., and Simchi-Levi, D., "Analytical Analysis of Vehicle Routing and Inventory Routing Problems," in M. Ball, T. Magnanti, C. Monma, and G. Nemhauser (Eds.), Handbook on Operations Research and Management Science, 1995.
28. Federgruen, A., and Tzur, M., "Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models," Management Science, 41, 874-893 (1995).
29. Federgruen, A., and Tzur, M., "The Dynamic Lot-Sizing Model with Backlogging: A Simple O(n log n) Algorithm and Minimal Forecast Horizon Procedure," Naval Research Logistics, 40, 459-478 (1993).
30. Federgruen, A., and Tzur, M., "Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited," Operations Research. 42, 456-468 (1994).
31. Federgruen, A., and Tzur, M., "The Joint Replenishment Problem with Time-Varying Parameters: Efficient, Asymptotic and ∈-Optimal Solutions," Operations Research, 42 1067-1086 (1994).
32. Fleischmann, B., "The Discrete Lotsizing and Scheduling Problem," European Journal of Operational Research, 44, 337-348 (1990).
33. Fleischmann, B., and Popp, T., "Das dynamische Losgroessenproblem mit reihenfolgeabhaengigen Ruestkosten," Technical Report, Institut fuer Unternehmungsforschung, University of Hamburg, Hamburg, Germany (1988).
34. Galil, Z., and Giancarlo, R., "Speeding Up Dynamic Programming with Applications to Molecular Biology," Theoretical Computer Science, 64, 107-118 (1989).
35. Goldstein, Z., Ladany, S.P., and Mehrez, A., "A Dual Machine Replacement Model - A Note on Planning Horizon Procedures for Machine Replacements," Operations Research, 34, 938-941 (1986).
36. Hartley, R., Thomas, L.C., and White, D.J., Recent Developments in Markov Decision Problems, Academic Press, New York, NY, 1980.
37. Herer, Y., and Roundy, R., "Heuristics for a One Warehouse Multi Retailer Distribution Problem with Performance Bounds," Operations Research, to appear.
38. Hopp, W.J., and Nair, S.K., "Timing Replacement Decisions Under Discontinuous Technological Change," Naval Research Logistics, 38, 203-220 (1991).
39. Joneja, D., "The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds," Operations Research, 38, 711-723 (1990).
40. Karp, R.M., "On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?," University of California at Berkeley, Berkeley, CA, 1992.
41. [41 Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, 1986.
42. Lee, C., and Denardo, E., "Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model," Mathematics of Operations Research, 11, 423-432 (1986).
43. Lundin, R.A., and Morton, T.E., "Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results," Operations Research, 23, 711-734 (1975).
44. Manne, A.S., and Veinott, A. F., Jr., "Optimal Plant Size with Arbitrary Increasing Time Paths of Demand," Chap. 11 in A. Manne (Ed.) Investment for Capacity Expansion: Size, Location and Time Phasing, MIT Press, Cambridge, MA, 1967.
45. McKenzie, L., "Turnpike Theory," Econometrica, 44, 841-864 (1976).
46. Megiddo, N., "Solving Linear Programming in Linear-Time When the Dimension is Fixed," Journal of the Association of Computing Machinery, 31, 114-127 (1984).
47. Megiddo, N., "On the Least Index Pivot Rule with Randomly Permuted Columns," IBM San Jose, CA, 1992.
48. Puterman, M., Dynamic Programming and its Applications, Academic Press, New York, 1978.
49. Sethi, S., and Chand, S., "Planning Horizon Procedures for Machine Replacement Models," Management Science, 25, 140-151 (1979).
50. Solomon, M., "Deterministic Lotsizing Models for Production Planning," Ph.D. dissertation, Erasmus University, Rotterdam, The Netherlands (1990).
51. Stalk, G., Evans, P., and Shulman, L., "Competing on Capabilities: The New Rules of Corporate Strategy," Harvard Business Review, 57-69 (1992).
52. Steele, D.C., "The Nervous MRP Systems: How to do Battle," Production and Inventory Management, 16, 83-89 (1973).
53. Tzur, M., "Learning in Setups: Analysis, Minimal Forecast Horizons and Algorithms," Management Science, to appear.
54. Veinott, A.F. ,Jr., "Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems," Operations Research, 17, 262-291 (1969).
55. Wagner, H.M., and Whitin, T.M., "Dynamic Version of the Economic Lot Size Model," Management Science, 5, 89-96 (1958).
56. White, C.C., Thomas, L.C., and Scherer, W., "Reward Revision for Discounted Markov Decision Problems," Operations Research, 33, 1299-1315 (1985).
57. Zabel, E., "Some Generalization of Inventory Planning Horizon Theorem," Management Science, 10, 465-471 (1964).