Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue.

Artalejo, J.R.; Gomez-Corral, A.

Displaying similar documents to “Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue.”

A finite capacity queue with Markovian arrivals and two servers with group services.

Chakravarthy, S., Alfa, Attahiru Sule (1994)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Bulk input queues with quorum and multiple vacations.

Dshalalow, Jewgeni H., Yellen, Jay (1996)

Mathematical Problems in Engineering

Similarity:

On applications of excess level processes to (N,D)-policy bulk queueing systems.

Dshalalow, Jewgeni H. (1996)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Some performance measures for vacation models with a batch Markovian arrival process.

Matendo, Sadrac K. (1994)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

A finite capacity bulk service queue with single vacation and Markovian arrival process.

Gupta, U.C., Sikdar, Karabi (2004)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

The $M^{X} / G / 1$ queue with queue length dependent service times.

Choi, Bong Dae, Kim, Yeong Cheol, Shin, Yang Woo, Pearce, Charles E.M. (2001)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

On a bulk queueing system with impatient customers.

Tadj, Lotfi, Benkherouf, Lakdere, Aggoun, Lakhdar (1998)

Mathematical Problems in Engineering

Similarity:

Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline.

Gupta, U.C., Banik, A.D., Pathak, S.S. (2005)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Analysis of an MAP/PH/1 queue with flexible group service

Arianna Brugno, Ciro D&amp;#039;Apice, Alexander Dudin, Rosanna Manzo (2017)

International Journal of Applied Mathematics and Computer Science

Similarity:

A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian...