Add to ORKGWe consider the queueing system denoted by M/M(N)/1/N where customers are served in batches of maximum size N. The model is motivated by a traffic application. The time-dependent probability distribution for the number of customers in the system is obtained in closed form. The solution is used to predict the optimal service rates during a finite time horizon
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
A multi-server queueing system, that is loaded continuously in certain periods of time and which fun...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
We consider the queueing system denoted by M/M(N)/1/N where customers are served in batches of maxim...
We analyzed an M/M/R queueing system with finite capacity N where customers have multiple classes wi...
Consider a service system of the type MAP/G(k)/1/r with a finite buffer of the size r. Let B_k(t) be...
We consider a M2θ/G/1/m queueing system with arrival of customer batches, which uses a threshold con...
In telecommunications networks, usually an aggregation of information units (a batch) is transmitted...
We consider an M/M/R queueing system with finite capacity N, where customers have two arrival modes ...
A queueing system (M/G1,G2/1/K) is considered in which the service time of a customer entering servi...
AbstractAn embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the s...
Consideration is given to the queuing system with one server, finite-length buffer, and Markov flow ...
Recent studies indicate that in many situations service times are affected by the experienced queuei...
Abstract. The distribution of the remaining service time upon reaching some target level in an M/G/1...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
A multi-server queueing system, that is loaded continuously in certain periods of time and which fun...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
We consider the queueing system denoted by M/M(N)/1/N where customers are served in batches of maxim...
We analyzed an M/M/R queueing system with finite capacity N where customers have multiple classes wi...
Consider a service system of the type MAP/G(k)/1/r with a finite buffer of the size r. Let B_k(t) be...
We consider a M2θ/G/1/m queueing system with arrival of customer batches, which uses a threshold con...
In telecommunications networks, usually an aggregation of information units (a batch) is transmitted...
We consider an M/M/R queueing system with finite capacity N, where customers have two arrival modes ...
A queueing system (M/G1,G2/1/K) is considered in which the service time of a customer entering servi...
AbstractAn embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the s...
Consideration is given to the queuing system with one server, finite-length buffer, and Markov flow ...
Recent studies indicate that in many situations service times are affected by the experienced queuei...
Abstract. The distribution of the remaining service time upon reaching some target level in an M/G/1...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
A multi-server queueing system, that is loaded continuously in certain periods of time and which fun...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...