zbMATH — the first resource for mathematics

Some properties of optimal control policies for entry to an M/M/1 queue. (English) Zbl 0534.60086
Summary: Customers served by an M/M/1 queueing system each receive a reward R but pay a holding cost of C per unit time (including service time) spent in the system. The decision of whether or not a customer joins the queue can be made on an individual basis or a social basis. The effect of increasing the arrival rate on the optimal policy parameters is examined. Some limiting results are also derived.

60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
Full Text: DOI
[1] and , ”Control of Arrivals to a Stochastic Input-Output System,” Industrial Engineering Report No. 78-1, North Carolina State University, Raleigh, NC (1978).
[2] Knudsen, Econometrica 40 pp 515– (1972)
[3] and , ”Individual and Social Optimization in Birth-Death Congestion System with a General Cost-Benefit Structure,” Industrial Engineering Report No. 76-8, North Carolina State University, Raleigh, NC (1976).
[4] Lippman, Operations Research 25 pp 233– (1977)
[5] Naor, Econometrica 37 pp 15– (1969)
[6] Rosenshine, Transportation Research 1 pp 97– (1967)
[7] and , ”Optimal Control of Queueing Systems,” in Mathematical Methods in Queueing Theory, Lecture Notes in Economics and Mathematical Systems, 98, 263–294 (Springer-Verlag, 1974). · doi:10.1007/978-3-642-80838-8_13
[8] Stidham, Management Science 24 pp 1598– (1978)
[9] Yechiali, Operations Research 19 pp 349– (1971)
[10] Yechiali, Management Science 18 pp 434– (1972)
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.