Hostname: page-component-89b8bd64d-ksp62 Total loading time: 0 Render date: 2026-05-06T21:38:57.076Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Scheduling of a Finite Capacity Shuttle under Delayed Information

Published online by Cambridge University Press:  27 July 2009

Mark P. Van Oyen  and
Demosthenis Teneketzis
Mark P. Van Oyen
Affiliation:
Department of Electrical Engineering and Computer Science University of Michigan, 1301 Beal A venue Ann Arbor, Michigan 48109-2122
Demosthenis Teneketzis
Affiliation:
Department of Electrical Engineering and Computer Science University of Michigan, 1301 Beal A venue Ann Arbor, Michigan 48109-2122
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the optimal scheduling of a finite capacity shuttle in a two-node network with imperfect information. When shuttle trips do not depend on the number of passengers carried, we prove optimality and monotonicity of threshold policies. We derive conditions for dispatching that reduce the computational effort required to compute an optimal threshold policy. We prove a counter-example to the optimality of threshold policies for finite horizon problems where trip lengths increase stochastically in the number of passengers carried.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 1 , January 1992 , pp. 29 - 61
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Barnett, A. (1973). On operating a shuttle service. Networks 3: 305–313.Google Scholar
Deb, R.K. (1978). Optimal dispatching of a finite capacity shuttle. Management Science 24: 1362–1372.CrossRefGoogle Scholar
Dror, I.M. (1978). Shuttle systems with one carrier and two passenger queues. Ph.D. thesis, Columbia University, New York.Google Scholar
Ignall, E. & Kolesar, P. (1972). Operating characteristics of a simple shuttle under local dispatching rules. Operations Research 20: 1077–1088.Google Scholar
Ignall, E. & Kolesar, P. (1974). Optimal dispatching of an infinite-capacity shuttle: Control at a single terminal. Operations Research 22: 1008–1024.Google Scholar
Kumar, P.R. & Varaiya, P. (1986). Stochastic systems: Estimation, identification, and adaptive control. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
Ross, S. (1983). Introduction to stochastic dynamic programming. New York: Academic Press.Google Scholar
Sennot, L. I. (1989). Average cost optimal stationary policies in infinite state Markov decision processes with unbounded costs. Operations Research 37: 626–633.CrossRefGoogle Scholar