Acceptance and Dispatching Policies for a Distribution Problem

Published Online:https://doi.org/10.1287/trsc.32.2.127

References

  • Alden J. M. , Smith R. L. Rolling horizon procedures in nonhomogeneous Markov decision processes. Opns. Res. (1992) 40 S183 S194 LinkGoogle Scholar
  • Asgharzadeh K. , Newell G. Optimal dispatching strategies for vehicles having exponentially distributed trip times. Naval Res. Logist. Quart. (1978) 25 489 509 CrossrefGoogle Scholar
  • Barnett A. On operating a shuttle service. Networks (1973) 3 305 313 CrossrefGoogle Scholar
  • Bertsekas D. P. , Tsitsiklis J. N. Neuro-Dynamic Programming (1996) (Athena Scientific, New York) Google Scholar
  • Daganzo C. F. The break-bulk role of terminals in many-to-many logistic networks. Opns. Res. (1987) 35 543 555 LinkGoogle Scholar
  • Daganzo C. F. A comparison of in-vehicle and out-of-vehicle freight consolidation strategies. Transportation Res. (1988) 22B 173 180 CrossrefGoogle Scholar
  • Deb R. K. Optimal control of batch service queues with switching costs. Adv. Appl. Probab. (1976) 8 177 194 CrossrefGoogle Scholar
  • Deb R. K. Optimal dispatching of a finite capacity shuttle. Management Sci. (1978) 24 1362 1372 LinkGoogle Scholar
  • Deb R. K. , Schmidt C. P. Optimal average cost policies for the two-terminal shuttle. Management Sci. (1987) 33 662 669 LinkGoogle Scholar
  • Deb R. K. , Serfozo R. F. Optimal control of batch service queues. Adv. Appl. Probab. (1973) 5 340 361 CrossrefGoogle Scholar
  • Hassin R. , Henig M. I. Control of arrivals and departures in a state-dependent input–output system. Opns. Res. Lett. (1986) 5 33 36 CrossrefGoogle Scholar
  • Haviv M. , Puterman M. L. Bias optimality in controlled queueing systems. J. Appl. Probab. (1997) . to appear Google Scholar
  • Ignall E. , Kolesar P. Operating characteristics of a simple shuttle under local dispatching rules. Opns. Res. (1972) 20 1077 1088 LinkGoogle Scholar
  • Ignall E. , Kolesar P. Optimal dispatching of an infinite-capacity shuttle: Control at a single terminal. Opns. Res. (1974) 22 1008 1024 LinkGoogle Scholar
  • Kleywegt A. J. Dynamic and Stochastic Models with Freight Distribution Applications (1996) . Ph.D. dissertation, School of Industrial Engineering, Purdue University Google Scholar
  • Kleywegt A. J. Approximation methods for a distribution problem. (1997) . Technical report 97-13, The Logistics Institute, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia Google Scholar
  • Minkoff A. S. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Opns. Res. (1993) 41 77 90 LinkGoogle Scholar
  • Pliska S. R. Controlled jump processes. Stochastic Process. Appl. (1975) 3 259 282 CrossrefGoogle Scholar
  • Powell W. B. Analysis of vehicle holding and cancellation strategies in bulk arrival, bulk service queues. Transportation Sci. (1985) 19 352 377 LinkGoogle Scholar
  • Powell W. B. Iterative algorithms for bulk arrival, bulk service queues with Poisson and non-Poisson arrivals. Transportation Sci. (1986) 20 65 80 LinkGoogle Scholar
  • Powell W. B. , Golden B. L. , Assad A. A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam) 249 291 . Chap. 12 Google Scholar
  • Powell W. B. , Humblet P. The bulk service queue with a general control strategy: Theoretical analysis and a new computational procedure. Opns. Res. (1986) 34 267 275 LinkGoogle Scholar
  • Powell W. B. , Simão H. P. Numerical simulation of transient bulk queues with general vehicle dispatching strategies. Transportation Res. (1986) 20B 477 490 CrossrefGoogle Scholar
  • Stidham S. Socially and individually optimal control of arrivals to a GI/M/1 queue. Management Sci. (1978) 24 1598 1610 LinkGoogle Scholar
  • Stidham S. Optimal control of admission to a queueing system. IEEE Trans. Automat. Control (1985) 30 705 713 CrossrefGoogle Scholar
  • Weiss H. J. Further results on an infinite capacity shuttle with control at a single terminal. Opns. Res. (1981) 29 1212 1217 LinkGoogle Scholar
  • Yechiali U. On optimal balking rules and toll charges in the GI/M/1 queuing process. Opns. Res. (1971) 19 349 370 LinkGoogle Scholar
  • Yechiali U. Customers' optimal joining rules for the GI/M/s queue. Management Sci. (1972) 18 434 443 LinkGoogle Scholar
  • Yushkevich A. A. , Feinberg E. A. On homogeneous Markov models with continuous time and finite or countable state space. Theory Probab. Appl. (1979) 24 156 161 CrossrefGoogle 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.