A Metastrategy for Large-Scale Resource Management Based on Informational Decomposition

Published Online:https://doi.org/10.1287/ijoc.1040.0111

References

  • Bertsekas D. P., Tsitsiklis J. N.Parallel and Distributed Computation: Numerical Methods (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
  • Bertsekas D., Tsitsiklis J.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Cheung R., Powell W. B. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. (1996) 44:951–963LinkGoogle Scholar
  • Dejax P., Crainic T. A review of empty flows and fleet management models in freight transportation. Transportation Sci. (1987) 21:227–247LinkGoogle 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
  • Ermoliev Y., Ermoliev Y., Wets R. Stochastic quasigradient methods. Numerical Techniques for Stochastic Optimization (1988) (Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Frantzeskakis L., Powell W. B. A successive linear approximation procedure for stochastic dynamic vehicle allocation problems. Transportation Sci. (1990) 24:40–57LinkGoogle Scholar
  • Godfrey G., Powell W. B. An adaptive, distribution-free approximation for the newsvendor problem with censored demands, with applications to inventory and distribution problems. Management Sci. (2001) 47:1101–1112LinkGoogle Scholar
  • Godfrey G., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. (2002a) 36:21–39LinkGoogle Scholar
  • Godfrey G., Powell W. B. An adaptive, dynamic programming algorithm for stochastic resource allocation problems II: Multi-period travel times. Transportation Sci. (2002b) 36:40–54LinkGoogle Scholar
  • Graves S. C., Schwarz L. B. Multistage lot-sizing: An iterative procedure. Multi-level Production/Inventory Control Systems: Theory and Practice. TIMS Studies in the Management Sciences (1981) Vol. 16(North-Holland, New York) 95–110Google Scholar
  • Papadaki K., Powell W. B. A monotone adaptive dynamic programming algorithm for a stochastic batch service problem. Eur. J. Oper. Res. (2002) 142:108–127CrossrefGoogle Scholar
  • Papadaki K., Powell W. B. An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem. Naval Res. Logist. (2003) 50:742–769CrossrefGoogle Scholar
  • Powell W. B., Carvalho T. A. Dynamic control of logistics queueing network for large-scale fleet management. Transportation Sci. (1998) 32:90–109LinkGoogle Scholar
  • Powell W. B., Cheung R. Stochastic programs over trees with random arc capacities. Networks (1994) 24:161–175CrossrefGoogle Scholar
  • Powell W. B., Shapiro J. A., Simão H. P., Coullard R. F. C., Owens J. H. A representational paradigm for dynamic resource transformation problems. Annals of Operations Research (2001) Vol. 104(1–4(Kluwer Academic Publishers, Dordrecht, The Netherlands) 231–279Google Scholar
  • Puterman M. L.Markov Decision Processes (1994) (Wiley, New York) CrossrefGoogle Scholar
  • Shapiro J. A. A framework for representing and solving dynamic resource transformation problems. (1999) . Ph.D. thesis, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJGoogle Scholar
  • Sutton R., Barto A.Reinforcement Learning (1998) (MIT Press, Cambridge, MA) Google Scholar
  • Wagner H., Whitin T. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle Scholar
  • Zangwill W. 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
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.