# zbMATH — the first resource for mathematics

The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals. (English) Zbl 0715.90048
Summary: We consider the control of an infinite capacity shuttle which transports passengers between two terminals. The passengers arrive at each terminal according to a compound Poisson process and the travel time from one terminal to the other is a random variable following an arbitrary distribution. The following control limit policy is considered: dispatch the shuttle at terminal i, at the instant that the total number of passengers waiting at terminal i reaches or exceeds a predetermined control limit $$m_ i$$. The objective of this paper is to obtain the mean waiting time of an arbitrary passenger at each terminal for given control values $$m_ 1$$ and $$m_ 2$$. We also discuss a search procedure to obtain the optimal control values which minimize the total expected cost per unit time under a linear cost structure.

##### MSC:
 90B22 Queues and service in operations research 60K25 Queueing theory (aspects of probability theory) 93E20 Optimal stochastic control 90B06 Transportation, logistics and supply chain management
Full Text:
##### References:
 [1] M.L. Chaudhry and J.G.C. Templeton,A First Course in Bulk Queues (Wiley, New York, 1983). · Zbl 0559.60073 [2] R.B. Cooper,Introduction to Queueing Theory, 2nd ed. (Elsevier, North-Holland, New York, 1981). · Zbl 0486.60002 [3] R.K. Deb, Optimal dispatching of a finite capacity shuttle, Management Sci. 24 (1978) 1362–1372. · Zbl 0493.90039 [4] R.K. Deb and R.F. Serfozo, Optimal control of batch service queues, Adv. Appl. Probab. 5 (1973) 340–361. · Zbl 0264.60066 [5] R.K. Deb and C.P. Schmidt, Optimal average cost policies for the two-terminal shuttle, Management Sci. 33 (1987) 662–669. · Zbl 0614.90036 [6] E. Ignall and P. Kolesar, Optimal dispatching of an infinite capacity shuttle: control at a single terminal, Oper. Res. 22 (1974) 1008–1025. · Zbl 0297.90067 [7] H-S. Lee and M.M. Srinivasan, Control policies for the MxG/1 queueing system, Management Sci. 35 (1989) 708–721. · Zbl 0671.60099 [8] W.B. Powell, Analysis of vehicle holding and cancellation strategies in bulk arrival, bulk service queues, Transp. Sci. 19 (1985) 352–377. [9] W.B. Powell, Iterative algorithms for bulk arrivals, bulk service queues with Poisson and non-Poisson arrivals, Transp. Sci. 20 (1986) 65–79. · Zbl 0628.60099 [10] S.H. Sim and J.G.C. Templeton, Computational procedures for steady state characteristics of unscheduled multi-carrier shuttle systems, Europ. J. Oper. Res. 12 (1983) 190–202. · Zbl 0499.90036 [11] J. Teghem, Jr., Control of the service process in a queueing system, Europ. J. Oper. Res. 23 (1986) 141–158. · Zbl 0583.60092 [12] H.J. Weiss, The computation of optimal control limits for a queue with batch services, Management Sci. 25 (1979) 320–328. · Zbl 0426.90032 [13] H.J. Weiss, Further results on an infinite capacity shuttle with control at a single terminal, Oper. Res. 29 (1981) 1212–1217. · Zbl 0474.90039 [14] H.J. Weiss and S.R. Pliska, Optimal control of some Markov processes with applications to batch queueing and continuous review inventory systems, The Center for Mathematical Studies in Economics and Management Science, Discussion Paper no. 214, Northwestern University (April 1976).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.