×

A queueing model with bonus service for certain customers. (English) Zbl 0612.90044

A queueing model is introduced in which the management has a policy, because of economic reasons, of not operating the service counter unless a certain number, \(R+1\), of customers are available during each busy period. Thus, the first R customers who arrive must wait until the service counter is opened. Such a policy may cause the management to provide or render additional services to the first R customers. Assuming Poisson arrivals and that both regular and additional services follow exponential distributions, explicit expressions are derived for the stationary queue length and busy period distributions and their expected values. In the special case where \(R=1\), an explicit expression is presented for the stationary distribution of the waiting time.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Yadin, M.; Naor, P., Queueing systems with a removable service station, Oper. Res. Q., 14, 4, 383-405 (1963)
[2] Fuhrmann, S. W.; Cooper, R. B., Stochastic decompositions in the M/G/1 queue with generalized vacations, Oper. Res., 33, 5, 1117-1128 (1985) · Zbl 0585.90033
[3] Levy, Y.; Yechiali, U., An M/M/s queue with servers’ vacations, Inf., 14, 2, 154-164 (1976)
[4] Welch, P. D., On a generalized M/G/1 queueing process in which the first customer of each busy period receives exceptional service, Oper. Res., 12, 5, 736-752 (1964) · Zbl 0132.38404
[5] Scott, M., A queueing process with varying degree of service, Nav. Res. Logist. Q., 17, 4, 515-523 (1970) · Zbl 0221.60071
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.