Price-directed control of a closed logistics queueing network

Operations Research

Volumn 55, Issue 6, 2007, Pages 1022-1038

  Adelman, Daniel ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

Dynamic programming optimal control: semi Markov; Industries: transportation shipping; Programming: nonlinear; Queues: networks

Indexed keywords

GEOGRAPHIC LOCATIONS; INTERNAL PRICING PROBLEM; MARKOV DECISION PROCESS;

APPROXIMATION THEORY; DYNAMIC PROGRAMMING; LAGRANGE MULTIPLIERS; MARKOV PROCESSES; NONLINEAR PROGRAMMING; OPTIMAL CONTROL SYSTEMS;

QUEUEING NETWORKS;

EID: 38549109103     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0408     Document Type: Article

References (19)

1. Adelman, D. 2003. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management 5 348-371.
2. Adelman, D. 2004. A price-directed approach to stochastic inventory/ routing. Oper. Res. 52 499-514.
3. Adelman, D. 2006. A simple algebraic approximation to the Erlang loss system. Techical report, Graduate School of Business, University of Chicago, Chicago, IL.
4. Adelman, D., G. L. Nemhauser. 1999. Price-directed control of remnant inventory systems. Oper. Res. 47 889-898.
5. Association of American Railroads. 2004. Rail intermodal transportation. Report. Association of American Railroads, Washington, D.C.
6. Baccelli, F., P. Bremaud. 2003. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences. Springer-Verlag, Berlin, Heidelberg, New York.
7. Bertsekas, D. P. 1995. Nonlinear Programming, 2nd ed. Athena Scientific, Belmont, MA.
8. Bertsimas, D., J. Nino-Mora. 1999. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, The single-station case. Math. Oper. Res. 24 306-330.
9. de Farias, D. P., B. Van Roy. 2003. The linear programming approach to approximate dynamic programming. Oper. Res. 51 850-865.
10. Gallagher, J. 2003. Realigning Intermodal; Hub Group ditches franchise model for "network" approach to win back business. J. Commerce (Dec. 15) 12.
11. Harel, A. 1988. Sharp bounds and simple approximations for the Erlang delay and loss formulas. Management Sci. 34 959-972.
12. Lindley, D. V. 1952. The theory of queues with a single server. Proc. Cambridge Philos. Soc. 48 277-289.
13. McCrea, B. 2004. As intermodal services improve, more companies are finding real value in this shipping option. Logist. Management (March 1) 45.
14. McGill, J., G. J. van Ryzin. 1999. Revenue management: Research overview and prospects. Transportation Sci. 33 233-256.
15. Murphy, L. 2004. Safe harbor? Investors seek it in first qtr; Tide of caution lifts shipper Hub Group. Crain's Chicago Bus. (April 12) 4.
16. Posner, M., B. Bernholtz. 1968. Closed finite queueing networks with time lags. Oper. Res. 16 962-976.
17. Powell, W. B., T. Carvalho. 1998. Dynamic control of logistics queueing networks for large scale fleet management. Transportation Sci. 32 90-109.
18. Powell, W. B., H. Topaloglu. 2003. Stochastic programming in transportation and logistics. A. Ruszczynski, A. Shapiro, eds. Handbook in Operations Research and Management Science: Stochastic Programming. Elsevier, Amsterdam, The Netherlands, 555-635.
19. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York.