Add to ORKGWe consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balk...
Motivated by the trade-off issue between delay performance and energy consumption in modern computer...
In this paper we study a multiprogramming system consisting of an input-output unit (10 unit) and a ...
We consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojou...
Queueing models with simultaneous resource possession can be used to model production systems at whi...
We determine the distribution of the maximum level of the workload in some queueing, dam and storage...
This paper deals with a repair shop with multiple parallel servers, which has to carry out planned o...
We consider a storage model that can be either interpreted as a certain queueing model with dependen...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
In this paper we consider an M/M/1 queueing system in which the server can serve at two diff??erent ...
This paper is devoted to the analysis of a fluid queue with a buffer content that varies linearly du...
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive prioritie...
Using a non-productform queueing network model, two approximations are developed for computing the a...
We analyze the time-dependent behavior of an M / M / c priority queue having two customer classes, c...
A time-sharing system is modelled by a foreground-background queue with Poisson arrivals and indepen...
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balk...
Motivated by the trade-off issue between delay performance and energy consumption in modern computer...
In this paper we study a multiprogramming system consisting of an input-output unit (10 unit) and a ...
We consider the M/M/c queue, where customers transfer to a critical state when their queueing (sojou...
Queueing models with simultaneous resource possession can be used to model production systems at whi...
We determine the distribution of the maximum level of the workload in some queueing, dam and storage...
This paper deals with a repair shop with multiple parallel servers, which has to carry out planned o...
We consider a storage model that can be either interpreted as a certain queueing model with dependen...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
In this paper we consider an M/M/1 queueing system in which the server can serve at two diff??erent ...
This paper is devoted to the analysis of a fluid queue with a buffer content that varies linearly du...
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive prioritie...
Using a non-productform queueing network model, two approximations are developed for computing the a...
We analyze the time-dependent behavior of an M / M / c priority queue having two customer classes, c...
A time-sharing system is modelled by a foreground-background queue with Poisson arrivals and indepen...
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balk...
Motivated by the trade-off issue between delay performance and energy consumption in modern computer...
In this paper we study a multiprogramming system consisting of an input-output unit (10 unit) and a ...