×

The threshold policy in the M/G/1 queue with server vacations. (English) Zbl 0672.90054

Summary: This article deals with the M/G/1 queue with server vacations in which the return of the server to service depends on the number of customers present in the system. The main goal is optimization, which is done under the average cost criterion in the multiple- and single-vacation models as well as for the “total cost for one busy cycle” criterion in the multiple-vacation case. Expressions that characterize the optimal number of customers, below which the server should not start a new service period, are exhibited for the various cases. It is found that under the average cost criterion, the expression may be universal in the sense that it may hold for a general class of problems including such that arise in production planning and inventory theory (for the particular cost structure discussed).

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
90B05 Inventory, storage, reservoirs
90B30 Production models
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bell, Operations Research 21 pp 1281– (1973)
[2] ”Stopping Rule Problems,” in Ed., Applied Combinatorial Mathematics, Wiley, New York, pp. 284–319.
[3] Cooper, The Bell System Technical Journal 49 pp 399– (1970) · Zbl 0208.22502 · doi:10.1002/j.1538-7305.1970.tb01778.x
[4] Introduction to Queueing Theory, 2nd ed., North-Holland, Amsterdam, 1981.
[5] Doshi, Queueing Systems 1 pp 29– (1986) · Zbl 0655.60089
[6] Fuhrmann, Operations Research 33 pp 1117– (1985)
[7] Heyman, Operations Research 16 pp 362– (1968)
[8] Kella, Naval Research Logistics 35 pp 23– (1988)
[9] Queueing Theory, Volume 1: Theory, Wiley, New York, 1975.
[10] Levy, Management Science 22 pp 202– (1975)
[11] Skinner, Operations Research 15 pp 278– (1967)
[12] ”Queueing Analysis of Vacation Models, Part I: M/G/1 and Part II:M/G/1 with Vacations,” TLR Research Report No. TR87-0032 (1987), IBM Tokyo Research Laboratory, 5-19 Sanbacho, Chiyoda-ku, Tokyo 102.
[13] Teghem, European Journal of Operations Research 23 pp 141– (1986)
[14] ”The (TN,TN-1, ..., T1)–Policy for the M/G/1 Queue,” Technical Report (1986), Faculté Polytechnique de Mons, 7000 Mons, Belgium.
[15] Wolff, Operations Research 30 pp 223– (1982)
[16] Yadin, Operational Research Quarterly 14 pp 393– (1963)
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.