The M/G/1 retrial queue with Bernoulli schedule
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
A Single Server Poisson Input Queue with a Second Optional Channel
Queueing Systems: Theory and Applications
A discrete-time Geo/G/1 retrial queue with starting failures and second optional service
Computers & Mathematics with Applications
The well-posedness of an M/G/1 queue with second optional service and server breakdown
Computers & Mathematics with Applications
The N-policy for an unreliable server with delaying repair and two phases of service
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
An M/G/1 queue with second optional service and server breakdowns
Computers & Mathematics with Applications
A batch arrival retrial queueing system with two phases of service and service interruption
Computers & Mathematics with Applications
Journal of Computational and Applied Mathematics
Comparative analysis of a randomized N-policy queue: An improved maximum entropy method
Expert Systems with Applications: An International Journal
A priority retrial queue with second multi optional service and m immediate Bernoulli feedbacks
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
The two-phases-service m/m/1/n queuing system with the server breakdown and multiple vacations
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Analysis of an infinite multi-server queue with an optional service
Computers and Industrial Engineering
Hi-index | 0.00 |
We study an M/G/1 queue with second optional service. Poisson arrivals with mean arrival rate &lgr; (0) all demand the first ‘essential’ service, whereas only some of them demand the second ‘optional’ service. The service times of the first essential service are assumed to follow a general (arbitrary) distribution with distribution function B(v) and that of the second optional service are exponential with mean service time 1/&mgr;_2 (&mgr;_20). The time-dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been derived explicitly. Also the mean queue length and the mean waiting time have been found explicitly. The well-known Pollaczec–Khinchine formula and some other known results including M/D/1, M/E_{k}/1} and M/M/1 have been derived as particular cases.