Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography

Published Online:https://doi.org/10.1287/msom.4.1.25.287

References

  • Alden J., Smith R.L. Rolling horizon procedures in nonhomogeneous Markov decision processes. Oper. Res. (1992) 40:S183–S194LinkGoogle Scholar
  • Andreatta G., Mason F.M. A note on a perfect forward procedure for a single facility dynamic location relocation problem. Oper. Res. Lett. (1994) 15:81–83CrossrefGoogle Scholar
  • Anupindi R., Morton T.E., Pentico D. The non-stationary stochastic lead time inventory problem: Near-myopic bounds, heuristics, and testing. Management Sci. (1996) 42:124–129LinkGoogle Scholar
  • Aronson J.E. A survey of dynamic network flows. Ann. Oper. Res. (1989) 20:1–66CrossrefGoogle Scholar
  • Aronson J.E., Chen B.D. A forward network simplex algorithm for solving multiperiod network flow problems. Naval Res. Logist. Quart. (1986) 33:445–467CrossrefGoogle Scholar
  • Aronson J.E., Chen B.D. A primary/secondary memory implementation of a forward network simplex algorithm for multiperiod network flow problems. Comput. Oper. Res. (1989) 16:379–391CrossrefGoogle Scholar
  • Aronson J.E., Chen B.D. A computational study of empirical decision horizons in infinite horizon multiperiod network flow problems. IIE Trans. (1993) 25:73–76CrossrefGoogle Scholar
  • Aronson J.E., Thompson G.L. A survey on forward methods in mathematical programming. Large Scale Systems (1984) 7:1–16Google Scholar
  • Aronson J.E., Thompson G.L. The solution of multiperiod personnel planning problems by the forward simplex method. Large Scale Systems (1985) 9:129–139Google Scholar
  • Aronson J.E., Morton T.E., Thompson G.L. A forward algorithm and planning horizon procedure for the production smoothing problem without inventory. Eur. J. Oper. Res. (1984) 15:348–365CrossrefGoogle Scholar
  • Aronson J.E., Morton T.E., Thompson G.L. A forward simplex method for staircase linear programs. Management Sci. (1985) 31:664–679LinkGoogle Scholar
  • Baker K.R. An experimental study of the effectiveness of rolling schedules in production planning. Decision Sci. (1977) 8:19–27CrossrefGoogle Scholar
  • Baker K.R., Peterson D.W. An analytical framework for evaluating rolling schedules. Management Sci. (1979) 24:341–351LinkGoogle Scholar
  • Bastian M. A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation. Naval Res. Logist. (1992) 39:651–668CrossrefGoogle Scholar
  • Bastian M., Volkmer M. A perfect forward procedure for a single facility dynamic location relocation problem. Oper. Res. Lett. (1992) 12:11–16CrossrefGoogle Scholar
  • Bean J., Smith R.L. Conditions for the existence of planning horizons. Math. Oper. Res. (1984) 9:391–401LinkGoogle Scholar
  • Bean J., Smith R.L. Optimal capacity expansion over an infinite horizon. Management Sci. (1985) 31:1523–1532LinkGoogle Scholar
  • Bean J., Smith R.L. Conditions for the discovery of solution horizons. Math. Programming (1993) 59:215–229CrossrefGoogle Scholar
  • Bean J., Birge J., Smith R.L. Aggregation in dynamic programming. Oper. Res. (1987) 35:215–220LinkGoogle Scholar
  • Bean J., Hopp W., Duenyas I. A stopping rule for forecast horizons in nonhomogeneous Markov decision processes. Oper. Res. (1992) 40:1188–1199LinkGoogle Scholar
  • Bean J., Lohmann J., Smith R.L. Equipment replacement under technological change. Naval Res. Logist. (1994) 41:117–128CrossrefGoogle Scholar
  • Bean J., Noon C., Salton G. Asset divestiture at Homart Development Co. Interfaces (1987) 17:48–64LinkGoogle Scholar
  • Bean J., Smith R.L., Lasserre J.B. Denumerable nonhomogeneous Markov decision processes. J. Math. Anal. Appl. (1990) 153:64–77CrossrefGoogle Scholar
  • Bean J., Smith R.L., Lohmann J. A dynamic infinite horizon replacement economy decision model. The Engrg. Economist (1985) 30:99–120CrossrefGoogle Scholar
  • Bean J., Smith R.L., Yano C. Forecast horizons for the discounted dynamic lot size model allowing speculative motive. Naval Res. Logist. (1987) 34:761–774CrossrefGoogle Scholar
  • Bean J., Birge J., Mittenthal J., Noon C. Matchup scheduling with multiple resources, release dates and disruptions. Oper. Res. (1991) 39:470–483LinkGoogle Scholar
  • Beckmann M.J. Production smoothing and inventory control. Oper. Res. (1961) 9:456–467LinkGoogle Scholar
  • Bensoussan A., Proth J.M. Economical ordering quantities for the two products problem with joint production costs. RAI-RO-Automatic Control Production Systems (1985) 19:509–521Google Scholar
  • Bensoussan A., Crouhy M., Proth J.M.Mathematical Theory of Production Planning (1983) (North-Holland, Amsterdam, The Netherlands)Google Scholar
  • Bensoussan A., Proth J.M., Queyranne M. A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs. Naval Res. Logist. (1991) 38:729–742CrossrefGoogle Scholar
  • Bernardo J.J. The effect of inventory and production costs on the optimal planning horizon. Internat. J. Production Res. (1978) 16:103–114CrossrefGoogle Scholar
  • Bes C., Sethi S.P. Concepts of forecast and decision horizons: Applications to dynamic stochastic optimization problems. Math. Oper. Res. (1988) 13:295–310LinkGoogle Scholar
  • Bhaskaran S., Sethi S.P. Planning horizons for the wheat trading model. (1981) Proc. AMS 81 Conf.:197–201Google Scholar
  • Bhaskaran S., Sethi S.P. Planning horizon research: The dynamic programming/control theory interface. Proc. Internat. AMSE Winter Sympos. (1983) March 1-3Bermuda:155–160Google Scholar
  • Bhaskaran S., Sethi S.P. Decision and forecast horizons in a stochastic environment: A survey. Optimal Control Appl. Methods (1987) 8:201–217CrossrefGoogle Scholar
  • Bhaskaran S., Sethi S.P. The dynamic lot-size model with stochastic demands: A decision horizons study. Inform. Systems and Oper. Res. (1988) 26:213–224CrossrefGoogle Scholar
  • Blackburn J., Kunreuther H. Planning horizons for the dynamic lot size model with backlogging. Management Sci. (1974) 21:251–255LinkGoogle Scholar
  • Blackburn J., Millen R. Heuristic lot-sizing performance in a rolling-schedule environment. Decision Sci. (1980) 11:691–701CrossrefGoogle Scholar
  • Blikle A., Lo J. Horizon in dynamic programs with continuous time. Bull. Acad. Polon Sci. Ser. Sci. Math. Astronom. Phys. (1967) 15:513–519Google Scholar
  • Blocher J.D., Chand S. A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem. Eur. J. Oper. Res. (1996) 91:456–470CrossrefGoogle Scholar
  • Bylka S. Decision sequences and a horizon in dynamic model of inventories. Comput. Centre of the Polish Acad. Sci. Rep. 143 (1974) Google Scholar
  • Bylka S. Algorithm for finding horizontal plans in dynamic problems: The dynamic lot size model. Mitteilungen der Mathem (1978) (Gesellschaft der DDR, Heft 1) 87–92Google Scholar
  • Bylka S. Optimal policies for dynamic inventory models with discrete stochastic demands. (1979) . Okonomiske Institut, Kobenhavns Univ. Memo nr., Copenhagen, 76Google Scholar
  • Bylka S. Horizon theorems for the solution of the dynamic lot size model. Proc. 1st Internat. Sympos. Inventories (1982) Budapest, Hungary:649–660Google Scholar
  • Bylka S. Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter. Naval Res. Logist. (1997) 44:775–790CrossrefGoogle Scholar
  • Bylka S. A dynamic model for the single-vendor, multi-buyer problem. Internat. J. Production Econom. (1999) 59:297–304CrossrefGoogle Scholar
  • Bylka S., Sethi S.P. Existence of solution and forecast horizons in dynamic lot size model with nondecreasing holding costs. Production and Oper. Management (1992) 1:212–224CrossrefGoogle Scholar
  • Bylka S., Sethi S.P., Sorger G. Minimal forecast horizons in equipment replacement models with multiple technologies and general switching costs. Naval Res. Logist. (1992) 39:487–507CrossrefGoogle Scholar
  • Carlson D.A., Haurie A. Infinite horizon optimal control. Lecture Notes in Econom. Math. Systems #290 (1987) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Carlson R.C., Beckman S.L., Kropp D.H. The effectiveness of extending the horizon in rolling production scheduling. Decision Sci. (1982) 13:129–146CrossrefGoogle Scholar
  • Chand S. A note on dynamic lot sizing in rolling horizon environments. Decision Sci. (1982) 13:113–119CrossrefGoogle Scholar
  • Chand S. Rolling horizon procedures for the facilities-in-series inventory model with nested schedules. Management Sci. (1983) 29:237–249LinkGoogle Scholar
  • Chand S. Decision/forecast horizon results for a single-facility dynamic location/relocation problem. Oper. Res. Lett. (1988) 7:247–251CrossrefGoogle Scholar
  • Chand S., Morton T.E. Perfect planning horizons in cash balance problems. Management Sci. (1982) 28:652–669LinkGoogle Scholar
  • Chand S., Morton T.E. Minimal forecast horizon procedures for dynamic lot size models. Naval Res. Logist. Quart. (1986) 33:111–122CrossrefGoogle Scholar
  • Chand S., Sethi S.P. Planning horizon procedures for machine replacement models with several possible replacement alternatives. Naval Res. Logist. Quart. (1982) 29:483–493CrossrefGoogle Scholar
  • Chand S., Sethi S.P. Finite production rate inventory models with first-and second shift setups. Naval Res. Logist. Quart. (1983) 30:401–414CrossrefGoogle Scholar
  • Chand S., Sethi S.P. A dynamic lot size model with learning in setups. Oper. Res. (1990) 38:644–655LinkGoogle Scholar
  • Chand S., McClurg T., Ward J. A single machine replacement model with learning. Naval Res. Logist. (1993) 40:175–192CrossrefGoogle Scholar
  • Chand S., Sethi S.P., Proth J. Existence of forecast horizons in undiscounted discrete time lot size models. Oper. Res. (1990) 38:884–892LinkGoogle Scholar
  • Chand S., Sethi S.P., Sorger G. Forecast horizons in the discounted dynamic lot size model. Management Sci. (1992) 38:1034–1048LinkGoogle Scholar
  • Chand S., Traub R., Uzsoy R. Single machine scheduling with dynamic arrivals: Decomposition results and a forward algorithm. Naval Res. Logist. (1996) 43:709–719CrossrefGoogle Scholar
  • Charnes A., Cooper W.W., Mellon B. A model for optimizing production by reference to cost surrogates. Econometrica (1955) 23:307–323CrossrefGoogle Scholar
  • Charnes A., Dreze J., Miller M. Decision and horizon rules for stochastic planning problems: A linear example. Econometrica (1966) 34:307–330CrossrefGoogle Scholar
  • Cheevaprawatdomrong T., Smith R.L. Infinite horizon production scheduling in time-varing systems under stochastic demand. (2001) . Working paper, University of MichiganGoogle Scholar
  • Chen C.D., Lee C.Y. Error bound for the dynamic lot size model allowing speculative motive. IIE Trans. (1995) 27:683–688CrossrefGoogle Scholar
  • Chen H.D., Hearn D.W., Lee C.Y. Minimizing the error bound for the dynamic lot-size model. Oper. Res. Lett. (1995) 17:57–68CrossrefGoogle Scholar
  • Daskin M.S., Hopp W.J., Medina B. Forecast horizons and dynamic facility location planning. Ann. Oper. Res. (1992) 40:125–151CrossrefGoogle Scholar
  • Denardo E.V., Lee C.Y. Error bounds for the dynamic lot size model with backlogging. Ann. Oper. Res. (1991) 28:213–229CrossrefGoogle Scholar
  • Dorfman R.A., Samuelson P.A., Solow R.M.Linear Programming and Economic Analysis (1958) (McGraw-Hill, New York) Google Scholar
  • Dutta P.K. Finite-horizon optimization—Sensitivity and continuity in multi-sectoral models. J. Math. Econom. (1993) 22:101–123CrossrefGoogle Scholar
  • Eppen G.D., Gould F.J., Pashigian B.P. Extensions of the planning horizon theorem in the dynamic lot size model. Management Sci. (1969) 15:268–277LinkGoogle Scholar
  • Evans J. R., Saydam C., McKnew M. A note on solving the concave cost dynamic lot-sizing problem in almost linear time. J. Oper. Management (1989) 8:159–167CrossrefGoogle Scholar
  • Federgruen A., Tzur M. A simple forward algorithm to solve general dynamic lot sizing model with n periods in O(n log n) or O(n) time. Management Sci. (1991) 8:909–925LinkGoogle Scholar
  • Federgruen A., Tzur M. The dynamic lot sizing model with backlogging: A simple O(n log n) algorithm and minimal forecast horizon procedure. Naval Res. Logist. (1993) 40:459–478CrossrefGoogle Scholar
  • Federgruen A., Tzur M. Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: Nervousness revisited. Oper. Res. (1994) 42:456–468LinkGoogle Scholar
  • Federgruen A., 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 Sci. (1995) 41:874–893LinkGoogle Scholar
  • Federgruen A., Tzur M. Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future. Naval Res. Logist. (1996) 43:169–189CrossrefGoogle Scholar
  • Feichtinger G., Hartl R.F.Optimale Kontrolle Ökonomischer Prozesse: Anwendungen des Maximumprinzips in den Wirtschaftswis-senschaften (1986) (Walter De Gruyter, Berlin, Germany) CrossrefGoogle Scholar
  • Garcia A., Smith R.L. Solving nonstationary infinite horizon dynamic optimization problems. J. Math. Anal. Appl. (2000a) 244:304–317CrossrefGoogle Scholar
  • Garcia A., Smith R.L. Solving nonstationary infinite horizon stochastic production planning problems. Oper. Res. Lett. (2000b) 27:135–141CrossrefGoogle Scholar
  • Goldstein Z., Mehrez A. Replacement of technology when a new technological breakthrough is expected. Engrg. Optim. (1996) 27:265–278CrossrefGoogle Scholar
  • Grey D.R. Non-negative matrices, dynamic programming, and a harvesting problem. J. Appl. Probab. (1984) 21:685–694CrossrefGoogle Scholar
  • Hartl R.F. A forward algorithm for a generalized wheat trading model. Zeitschrift fur Oper. Res. (1986) 30:A135–A144Google Scholar
  • Hartl R.F. Ein mathematisches modell des weizenhandels. Quartalshefte der Girozentrale (1987) 22:31–38Google Scholar
  • Hartl R.F. A wheat trading model with demand and spoilage. Optimal Control Theory and Economic Analysis (1988) 3(North-Holland, Amsterdam, The Netherlands) 235–244Google Scholar
  • Hartl R.F., Feichtinger G. On forward algorithms for a generalized wheat trading model. Progress in Inventory Research. Proc. 4th Internat. Sympos. Inventories (1989) (Hungarian Academy of Science, Budapest, Hungary) 367–370CrossrefGoogle Scholar
  • Hartl R.F., Chikan A. Production smoothing under environmental constraint. Production & Oper. Management (1995) 4:46–56CrossrefGoogle Scholar
  • Haurie A., Hung N.M. Turnpike properties for the optimal use of natural resources. Rev. Econom. Stud. (1976) 31:1–24Google Scholar
  • Haurie A., Sethi S.P. Decision and forecast horizons, agreeable plans, and the maximum principle for infinite horizon problems. Oper. Res. Lett. (1984) 3:261–265CrossrefGoogle Scholar
  • Heady R.B., Zhu Z. An improved implementation of the Wagner-Whitin algorithm. Production and Oper. Management (1994) 3:55–63CrossrefGoogle Scholar
  • Herbon A., Khmelnitsky E., Maimon O. Effective information horizon length in measuring off-line performance of stochastic dynamic systems. (2000a) . Working paper, Tel Aviv University, IsraelGoogle Scholar
  • Herbon A., Khmelnitsky E., Maimon O., Yakubov Y. Reduction of future information required for optimal control of dynamic systems: A pseudo-stochastic model. (2000b) . Working paper, Tel Aviv University, IsraelGoogle Scholar
  • Hernandez-Lerma O., Lasserre J.B. A forecast horizon and a stopping rule for general Markov decision processes. J. Math. Anal. Appl. (1988) 132:388–400CrossrefGoogle Scholar
  • Hernandez-Lerma O., Lasserre J.B. Error bounds for rolling horizon policies in general Markov control processes. IEEE Trans. Automatic Control (1990) AC-35:1118–1124CrossrefGoogle Scholar
  • Heyman D.P., Sobel M.J.Stochastic Models in Operations Research Volume II: Stochastic Optimization (1984) (McGraw-Hill Book Company, New York) Google Scholar
  • Hopp W.J. A sequential model of R & D investment over an unbounded time horizon. Management Sci. (1987) 33:500–508LinkGoogle Scholar
  • Hopp W. Sensitivity analysis in discrete dynamic programming. J. Optim. Theory and Appl. (1988) 56:257–269CrossrefGoogle Scholar
  • Hopp W. Identifying forecast horizons in nonhomogeneous Mar-kov decision processes. Oper. Res. (1989) 37:339–343LinkGoogle Scholar
  • Hopp W., Nair S.K. Timing replacement decisions under discontinuous technological change. Naval Res. Logist. (1991) 38:203–220CrossrefGoogle Scholar
  • Hopp W., Spearman M.L.Factory Physics (2001) 2nd ed.(Irwin McGraw-Hill, New York) Google Scholar
  • Hopp W., Bean J., Smith R.L. A new optimality criteria for nonhomogeneous Markov decision processes. Oper. Res. (1987) 35:875–883LinkGoogle Scholar
  • Hsu V.N. Dynamic economic lot size model with perishable inventory. Management Sci. (2000) 46:1159–1169LinkGoogle Scholar
  • Ignall E., Veinott A.F. Optimality of myopic inventory policies for several substitute products. Management Sci. (1969) 16:284–304LinkGoogle Scholar
  • Iida T., Mori M. Markov decision processes with random horizon. J. Oper. Res. Japan (1996) 39:592–603Google Scholar
  • Johnson S.M. Sequential production planning over time at minimum cost. Management Sci. (1957) 3:435–437LinkGoogle Scholar
  • Johnson G.D., Thompson H.E. Optimality of myopic inventory policies for certain dependent demand processes. Management Sci. (1975) 21:1303–1307LinkGoogle Scholar
  • Johnson R. E., McClain J.O. On further results on planning horizons in the production smoothing problem. Management Sci. (1978) 24:1774–1776LinkGoogle Scholar
  • Kapuscinski R., Tayur S. Dynamic capacity reservation in a make-to-order environment. (2000) . Working paper, University of MichiganGoogle Scholar
  • Keerthi S.S., Gilbert E.G. Moving horizon approximations for a general class of optimal non-linear infinite horizon discrete-time systems. Proc. 20th Annual Conf. Inform. Sci. Systems (1986) Princeton, NJ:301–306Google Scholar
  • Keskinocak P., Ravi R., Tayur S. Scheduling and reliable lead time quotation for orders with availability intervals and lead time sensitive revenues. Management Sci. (2001) 47:264–279LinkGoogle Scholar
  • Kleindorfer P., Kunreuther H. Stochastic horizons for the aggregate planning problem. Management Sci. (1978) 24:485–497LinkGoogle Scholar
  • Kleindorfer P., Lieber Z. Algorithms and planning horizon results for production planning problems with separable costs. Oper. Res. (1979) 27:875–887LinkGoogle Scholar
  • Krawczyk J.B. Theorem on the existence of a rho-satisfying suboptimal control for linear-quadratic problems repetitively controlled. Control Cybernet (1979) 8:273–280Google Scholar
  • Krawczyk J.B. Properties of repetitive control of partially observed processes. Comput. Math. Appl. (1992) 24:111–124CrossrefGoogle Scholar
  • Krawczyk J.B., Karacaoglu G. On repetitive control and the behaviour of a middle-aged consumer. Eur. J. Oper. Res. (1993) 66:89–99CrossrefGoogle Scholar
  • Kunreuther H., Morton T.E. Planning horizons for the production smoothing with deterministic demands. Management Sci. (1973) 20:110–125LinkGoogle Scholar
  • Kunreuther H., Morton T.E. General planning horizons for the production smoothing with deterministic demands. Management Sci. (1974) 20:1037–1046LinkGoogle Scholar
  • Lasserre J.B. An on-line procedure in discounted infinite horizon stochastic optimal control. J. Optim. Theory and Appl. (1986a) 50:61–67CrossrefGoogle Scholar
  • Lasserre J.B. Detecting planning horizons in deterministic infinite horizon optimal control. IEEE Trans. Automatic Control (1986b) AC-31:70–72CrossrefGoogle Scholar
  • Lasserre J.B. Decision horizon, overtaking and 1-optimality criteria in optimal control. Advances in Optimization and Control. Lecture Notes in Econom. Math. Systems. (1988) (Springer-Verlag, New York) 247–261CrossrefGoogle Scholar
  • Lasserre J.B., Bes C. Infinite horizon nonstationary stochastic optimal control problems: A planning horizon result. IEEE Trans. Automatic Control (1984) AC-29:836–837CrossrefGoogle Scholar
  • Lasserre J.B., Roubellat F. A planning horizon result and a protective forward procedure for the bounded inventory problem with concave costs. Proc. 23rd IEEE Conf. Decision and Control (1984) Las Vegas, NVGoogle Scholar
  • Lasserre J.B., Bes C., Roubellat F. Some new planning horizons results in inventory management. Production Management: Methods and Studies (1986) (Elsevier Science Publishers, North Holland, Amsterdam, The Netherlands) 39–57Google Scholar
  • Lee C.Y., Denardo E.V., Lev B. Rolling planning horizon: Error bounds for the dynamic lot size model. Math. Oper. Res. (1986) 11:423–432LinkGoogle Scholar
  • Lee D.R., Orr D. Further results on planning horizons in the production smoothing problem. Management Sci. (1977) 23:490–498LinkGoogle Scholar
  • Lee Y.I., Kouvaritakis B. A linear programming approach to constrained robust predictive control. IEEE Trans. Automatic Control (2000) 45:1765–1770CrossrefGoogle Scholar
  • Lieber Z. An extension to Modigliani and Hohn's planning horizon results. Management Sci. (1973) 20:319–330LinkGoogle Scholar
  • Lo J. Horizon in dynamic programs. (1967) Proc. 5th Berkeley on Math. Statist. and Probab.(California University Press, Berkeley, CA) 479–490Google Scholar
  • Lo J., Le Cam L.M., Neyman J. The approximative horizon in von Neumann models of optimal growth. Recent Contributions to the von Neumann Models of Optimal Growth (1971) (Springer-Verlag, Vienna, Austria) Google Scholar
  • Lundin R.A., Morton T.E. Planning horizons for the dynamic lot size model: Zabel vs. protective procedures and computational results. Oper. Res. (1975) 23:711–734LinkGoogle Scholar
  • Mayne D.Q., Michalska H. Receding horizon control of nonlinear systems. IEEE Trans. Automatic Control (1990) 35:814–824CrossrefGoogle Scholar
  • McClain J., Thomas J. Horizon effects in aggregate production planning with seasonal demands. Management Sci. (1977) 23:728–736LinkGoogle Scholar
  • McKenzie L. Turnpike theory. Econometrica (1976) 44:841–864CrossrefGoogle Scholar
  • Michalska H., Mayne D.Q. Robust receding horizon control of constrained nonlinear systems. IEEE Trans. Automat. Control (1993) 38:1623–1633CrossrefGoogle Scholar
  • Michalska H., Mayne D.Q. Moving horizon observers and observer-based control. IEEE Trans. Automatic Control (1995) 40:995–1006CrossrefGoogle Scholar
  • Miller L.W. Using linear programming to derive planning horizons for a production smoothing problem. Management Sci. (1979) 25LinkGoogle Scholar
  • Modigliani F., Hohn F.E. Production planning over time and the nature of the expectation and planning horizon. Econometrica (1955) 23:46–66CrossrefGoogle Scholar
  • Morishima M. Proof of a turnpike theorem: The ‘no joint production’ case. Rev. Econom. Stud. (1961) 28:89–97CrossrefGoogle Scholar
  • Morton T.E. The non-stationary infinite horizon inventory problem. Management Sci. (1978a) 24:1474–1482LinkGoogle Scholar
  • Morton T.E. An improved algorithm for the stationary cost dynamic lot-size model with backlogging. Management Sci. (1978b) 24:869–873LinkGoogle Scholar
  • Morton T.E. Universal planning horizons for generalized convex production scheduling. Oper. Res. (1978c) 26:1046–1058LinkGoogle Scholar
  • Morton T.E. Infinite horizon dynamic programming models—A planning horizon formulation. Oper. Res. (1979) 27:730–742LinkGoogle Scholar
  • Morton T.E. Forward algorithms for forward thinking managers. Applications of Management Science (1981) I(JAI Press, Greenwich, CT) 1–55Google Scholar
  • Morton T.E., Dharan B.G. Algoristics for sequencing with precedence constraints. Management Sci. (1978) 24:1011–1020LinkGoogle Scholar
  • Morton T.E., Pentico D. The finite horizon non-stationary stochastic inventory problem: Near-myopic bounds, heuristics, testing. Management Sci. (1995) 41:334–343LinkGoogle Scholar
  • Morton T.E., Udayabhanu V. Planning horizons for capacity expansion. Eur. J. Oper. Res. (1988) 34:297–307CrossrefGoogle Scholar
  • Morton T.E., Wecker W. Discounting, ergodicity and convergence for Markov decision processes. Management Sci. (1977) 23:890–900LinkGoogle Scholar
  • Nagasawa H., Nishiyama N. Optimal decision procedure of planning horizon in aggregate production planning (1st report, a case of stationary demand patterns). J. Japan Soc. Mech. Engineers (1980) 46:1151–1159(Series C)CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Decision analysis for determining the optimum planning horizon in aggregate production planning. Internat. J. Production Res. (1982a) 20:243–254CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Optimal decision procedure of planning horizon in aggregate production planning (2nd report, a case of seasonal demand patterns). J. Japan Soc. Mech. Engineers (1982b) 48:906–913(Series C)CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Optimal decision procedure of planning horizon in aggregate production planning (3rd report, a case of a production system having constraints for production and inventory). J. Japan Soc. Mech. Engineers (1982c) 48:1520–1527(Series C)CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Decision method for determining the optimum planning horizon in case of demand forecast error. J. Japan Soc. Mech. Engineers (1983) 49:1446–1453(Series C)CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Decision analysis for determining the optimum planning horizon in aggregate production planning (Part 2. Difference between planning horizons in weekly and in monthly schedulings). Internat. J. Production Res. (1985a) 23:423–436CrossrefGoogle Scholar
  • Nagasawa H., Nishiyama N., Hitomi K. Sensitivity analysis of production time and cost coefficients for determining planning horizon in aggregate production planning. J. Japan Soc. Mech. Engineers (1985b) 51:1671–1678(Series C)CrossrefGoogle Scholar
  • Nair S.K. Modeling strategic investment decisions under sequential technological change. Management Sci. (1995) 41:282–297LinkGoogle Scholar
  • Nair S.K., Hopp W.J. A model for equipment replacement due to technological obsolescence. Eur. J. Oper. Res. (1992) 63:207–221CrossrefGoogle Scholar
  • Naphade K.S., Wu S.D., Storer R.H., Doshi B.J. Melt scheduling to trade off material waste and shipping performance. Oper. Res. (2001) 49(5):629–645LinkGoogle Scholar
  • Nerlove M., Arrow K.J. Optimal advertising policy under dynamic conditions. Economica (1962) 29:129–142CrossrefGoogle Scholar
  • Ovacik I.M., Uzsoy R. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Internat. J. Production Res. (1995) 33:3173–3192CrossrefGoogle Scholar
  • Park Y., Bean J., Smith R.L. Optimal average value convergence in nonhomogeneous Markov decision processes. J. Math. Anal. Appl. (1993) 179:525–536CrossrefGoogle Scholar
  • Pekelman D. Simultaneous price-production decisions. Oper. Res. (1974) 22:788–794LinkGoogle Scholar
  • Pekelman D. Production smoothing with fluctuating price. Management Sci. (1975) 21:576–590LinkGoogle Scholar
  • Pekelman D. On optimal utilization of production processes. Oper. Res. (1979) 27:260–278LinkGoogle Scholar
  • Presman E.L., Sethi S.P. Equivalence of objective functionals in infinite horizon and random horizon problems. Optimal Consumption and Investment with Bankruptcy (1997) (Kluwer Academic Publishers, Boston, MA) . Chapter 10CrossrefGoogle Scholar
  • Primbs J.A., Nevistic V., Sethi S.P. A framework for robustness analysis of constrained finite receding control. IEEE Trans. Automatic Control (2000) 45:1828–1838CrossrefGoogle Scholar
  • Proth J.M. The impulse control problem with concave costs: On the search of planning horizons. Proc. 6th Internat. Conf. Anal. Optim. Systems (1984) June 19-22Nice, FranceCrossrefGoogle Scholar
  • Radner R. Paths of economic growth that are optimal with regard only to final states: A turnpike theorem. Rev. Econom. Stud. (1961) 28:98–104CrossrefGoogle Scholar
  • Rajagopalan S. Deterministic capacity expansion under deterioration. Management Sci. (1992) 38:525–539LinkGoogle Scholar
  • Rajagopalan S. Capacity expansion with alternative technology choice. Eur. J. Oper. Res. (1994) 77:392–403CrossrefGoogle Scholar
  • Ravn H.F. A forward maximum principle algorithm with decision horizon results. Appl. Math. Comput. (1987) 24:65–75CrossrefGoogle Scholar
  • Rempala R. A dynamic programming problem for a two-commodity inventory model. New Trends in Dynamic System Theory and Economics (1979) (Academic Press, San Diego, CA) 269–280Google Scholar
  • Rempala R., Aoki M., Marzollo A. On the multicommodity Arrow-Karlin inventory model, Part II. Horizon and horizontal solution. New Results in Inventory Research (1984) (Hungarian Academy of Sciences, Budapest, Hungary) 785–792Google Scholar
  • Rempala R., Chikan A., Aka-demiai Kiado. Dynamic family of multicommodity inventory problems. Math. Control Theory. (1985) 14:439–452Google Scholar
  • Rempala R. Horizontal solution of an inventory problem with stochastic prices. Inventory in Theory and Practice (1986) 6(Elsevier, Amsterdam, The Netherlands) 715–725Studies in Production and Engineering EconomicsGoogle Scholar
  • Rempala R. Horizon for a dynamic family of wheat trading problems. Progress in Inventory Research (1989a) (Hungarian Academy of Sciences, Budapest, Hungary) 411–415CrossrefGoogle Scholar
  • Rempala R., Chikan A., Aka-demiai Kiado. An inventory problem with nonlinear spoilage. Sitzungsbericht, I, Konferenz Lagerhaltungs systeme and Logistic (1989b) (Math. Gesellschaft DDR, Leipzig) 99–105Google Scholar
  • Rempala R., Girlich H.J. Forecast horizons in nonstationary Markov decision problems. Optim. (1989c) 20:853–857CrossrefGoogle Scholar
  • Rempala R. Forecast horizon in a convex cost inventory model with spoilage. Engrg. Costs and Production Econom. (1990) 19:371–374CrossrefGoogle Scholar
  • Rempala R. Forecast horizon in a dynamic family of one-dimensional control problems. (1991) (Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland) . Dissertationes Mathematicae CCCXVGoogle Scholar
  • Rempala R. On a forward algorithm for a generalized production inventory problem. Internat. J. Production Econom. (1999) 59:455–461CrossrefGoogle Scholar
  • Rempala R., Sethi S.P. Forecast horizons in single product inventory models. Optimal Control Theory and Econom. Anal. (1988) 3:225–233Google Scholar
  • Rempala R., Sethi S.P. Decision and forecast horizons for one-dimensional optimal control problems: Existence results and applications. Optimal Control Appl. Methods (1992) 13:179–192CrossrefGoogle Scholar
  • Richter K., Weber J. Sequential stability of the constant cost dynamic lot-size model-searching for monotonicity. OR Spektrum (1994) 15:197–203CrossrefGoogle Scholar
  • Ross S.M.Introduction to Stochastic Dynamic Programming (1984) (Academic Press, New York) Google Scholar
  • Russel R. A., Urban T.L. Horizon extensions for rolling production schedules: Length and accuracy requirement. Internat. J. Production Econom. (1993) 29:64–74Google Scholar
  • Ryan S.M. Forecast frequency in rolling horizon hedging heuristics for capacity expansion. Eur. J. Oper. Res. (1998) 109:550–558CrossrefGoogle Scholar
  • Ryan S.M., Bean J. Degeneracy in infinite horizon optimization. Math. Programming (1989) 43:305–316CrossrefGoogle Scholar
  • Ryan S.M., Bean J., Smith R.L. A tie-breaking rule for discrete infinite horizon optimization. Oper. Res. (1992) 40:S117–S126LinkGoogle Scholar
  • Sandbothe R.A., Thompson G.L. A forward algorithm for the capacitated lot size model with stockouts. Oper. Res. (1990) 38:474–486LinkGoogle Scholar
  • Sandbothe R.A., Thompson G.L. Decision horizons for the capacitated lot size model with inventory bounds and stockouts. Comput. Oper. Res. (1993) 20:455–465CrossrefGoogle Scholar
  • Saydam C., McKnew M. A fast microcomputer program for ordering using the Wagner-Whitin algorithm. Production and Inventory Management J. (1987) 28:15–19Google Scholar
  • Schochetman I.E., Smith R.L. Infinite horizon optimization. Math. Oper. Res. (1989) 14:559–574LinkGoogle Scholar
  • Schochetman I.E., Smith R.L. Convergence of selections with applications in optimization. J. Math. Anal. Appl. (1991) 155:278–292CrossrefGoogle Scholar
  • Schochetman I.E., Smith R.L. Finite dimensional approximation in infinite dimensional mathematical programming. Math. Programming (1992) 54:307–333CrossrefGoogle Scholar
  • Schochetman I.E., Smith R.L. Existence and discovery of average optimal solutions in deterministic infinite horizon optimization. Math. Oper. Res. (1998) 23:416–432LinkGoogle Scholar
  • Schwarz L.B. A note on the near optimality of 5-EOQ's worth forecast horizons. Oper. Res. (1977) 25:533–536LinkGoogle Scholar
  • Sethi S.P. A note on a planning horizon model of cash management. J. Financial and Quant. Anal. (1971) 6:659–665CrossrefGoogle Scholar
  • Sethi S.P. Optimal control of the Vidale-Wolfe advertising model. Oper. Res. (1973) 21:998–1013LinkGoogle Scholar
  • Sethi S.P. Quantitative guidelines for communicable disease control program: A complete synthesis. Biometrics (1974) 30:681–691CrossrefGoogle Scholar
  • Sethi S.P. Nearest feasible paths in optimal control problems: Theory, examples, counterexamples. J. Optim. Theory and Appl. (1977) 23(4):563–579CrossrefGoogle Scholar
  • Sethi S.P. Optimal equity financing model of Krouse and Lee: Corrections and extensions. J. Financial and Quant. Anal. (1978) 13:487–505CrossrefGoogle Scholar
  • Sethi S.P. Application of the maximum principle to production and inventory problems. Proc. 3rd Internat. Sympos. Inventories (1984) Budapest, Hungary:753–756Google Scholar
  • Sethi S.P. Forecast horizons in operations management problems: A tutorial. Proc. 2nd Internat. Conf. Production Systems (1987) (INRIA, Le Chesnay Cedex, France) 37–48Google Scholar
  • Sethi S.P., Singh M. Decision and forecast horizons in dynamic optimization. Systems and Control Encyclopedia Supplementary (1990) 1(Pergamon Press, Oxford, U.K.) 192–198Google Scholar
  • Sethi S.P., Bes C., Eiselt H. A., Pederzoli G. Dynamic stochastic optimization problems in the framework of forecast and decision horizons. Advances in Optimization and Control, Lecture Notes in Economics and Mathematical Systems # 302 (1988) (Springer-Verlag, New York) 230–246CrossrefGoogle Scholar
  • Sethi S.P., Bhaskaran S., Eiselt H. A., Pederzoli G. Conditions for the existence of decision horizons for discounted problems in a stochastic environment: A note. Oper. Res. Lett. (1985) 4:61–64CrossrefGoogle Scholar
  • Sethi S.P., Chand S. Planning horizon procedures in machine replacement models. Management Sci. (1979) 25:140–151LinkGoogle Scholar
  • Sethi S.P., Chand S. Multiple finite production rate dynamic lot size inventory models. Oper. Res. (1981) 29:931–944LinkGoogle Scholar
  • Sethi S.P., Sorger G. Concepts of forecast horizons in dynamic games. Proc. 28th IEEE-CDC (1989) Dec. 13-15Tampa, FL:195–197Google Scholar
  • Sethi S.P., Sorger G. A theory of rolling horizon decision making. Ann. Oper. Res. (1991) 29:387–416CrossrefGoogle Scholar
  • Sethi S.P., Thompson G.L. Planning and forecast horizons in a simple wheat trading model. Operations Research in Progress (1982) (Reidel Publishing Co., Boston, MA) 203–214CrossrefGoogle Scholar
  • Sethi S.P., Thompson G.L.Optimal Control Theory: Applications to Management Science and Economics (2000) 2nd ed.(Kluwer Academic Publishers, Boston, MA) Google Scholar
  • Shapiro J.F., Feichtinger G., Kall P. Turnpike planning horizons for a Markovian decision model. Management Sci. (1968) 14:292–300LinkGoogle Scholar
  • Shapiro J.F., Wagner H.M. A finite renewal algorithm for knapsack and turnpike models. Oper. Res. (1967) 15:319–341LinkGoogle Scholar
  • Smith R.L. Planning horizons for the deterministic capacity problem. Comput. Oper. Res. (1981) 8:209–220CrossrefGoogle Scholar
  • Smith R.L., Zhang R.Q. Infinite horizon production planning in time-varying systems with convex production and inventory costs. Management Sci. (1998) 44:1313–1320LinkGoogle Scholar
  • Stadtler H. Improved rolling schedules for the dynamic single-level lot-sizing problem. Management Sci. (2000) 46:318–326LinkGoogle Scholar
  • Sung C.S., Lee W.S. Rolling schedules for a dynamic lot-sizing problem with start-up cost. Engrg. Optim. (1994) 22:137–152CrossrefGoogle Scholar
  • Takayama A.Mathematical Economics (1974) (The Dryden Press, Hinsdale, IL) Google Scholar
  • Teng J., Thompson G.L., Sethi S.P. Strong decision and forecast horizons in a convex production planning problem. Optimal Control Appl. Methods (1984) 5:319–330CrossrefGoogle Scholar
  • Tesfatsion L. Dynamic investment, risk aversion, and foresight sensitivity. J. Econom. Dynam. Control (1981) 3:65–96CrossrefGoogle Scholar
  • Thomas L.J. Price-production decisions with deterministic demand. Management Sci. (1970) 16:747–750LinkGoogle Scholar
  • Thompson G.L., Sethi S.P. Turnpike horizons for production planning. Management Sci. (1980) 26:229–241LinkGoogle Scholar
  • Thompson G.L., Sethi S.P., Teng J. Strong planning and forecast horizons for a model with simultaneous price and production decisions. Eur. J. Oper. Res. (1984) 16:378–388CrossrefGoogle Scholar
  • Tzur M. Learning in setups: Analysis, minimal forecast horizons, and algorithms. Management Sci. (1996) 42:1732–1743LinkGoogle Scholar
  • Udayabhanu V., Morton T.E. Planning horizons for capacity expansion. Eur. J. Oper. Res. (1988) 34:297–307CrossrefGoogle Scholar
  • Vanthienen L. A simultaneous price-production decision making with production adjustment costs. Proc. XX Internat. Meeting of TIMS (1973) 1June 24-29Tel Aviv, Israel(Jerusalem Academic Press, Jerusalem, Israel) 249–254Google Scholar
  • Veinott A.F. Optimal policy for a multi-product, dynamic nonstationary inventory problem. Management Sci. (1965) 12:206–212LinkGoogle Scholar
  • Wagner H.M., Whitin T.M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle Scholar
  • Wemmerlov U., Whybark D.C. Lot-sizing under uncertainty in a rolling schedule environment. Internat. J. Production Res. (1984) 22:467–484CrossrefGoogle Scholar
  • White D.J. Decision roll and horizon roll processes in infinite horizon discounted Markov decision processes. Management Sci. (1996) 42:37–50LinkGoogle Scholar
  • Willke T.L., Miller R.A. Production planning and control II. The planning horizon problem. Internat. J. Systems Sci. (1978) 9:1259–1270CrossrefGoogle Scholar
  • Zabel E. Some generalizations of an inventory planning horizon theorem. Management Sci. (1964) 10:465–471LinkGoogle Scholar
  • Zangwill W.I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system—A network approach. Management Sci. (1969) 15:506–527LinkGoogle Scholar
  • Zipkin P.H.Foundations of Inventory Management (2000) (McGraw Hill Company, New York) Google 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.