In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that concern, this paper focuses on developing a methodology by taking fluid and diffusion limits in a non-traditional fashion. We show that our approximation is significantly more accurate and also asymptotically true. We illustrate the effectiveness of our methodology by performing several numerical experiments. Key words: transient analysis; multi-serv...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
Recently, [1] have obtained the transient solution of multi-server queue with balking and reneging. ...
Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier r...
In this paper, we consider time-varying multiserver queues with abandonment and retrials. For their ...
In this paper, we consider modeling time-dependent multi-server queues that include aban-donments an...
We study many-server queues with abandonment in which customers have general service and patience ti...
Insight is provided into a previously developed M/M/s/r+M(n) approximation for the M/GI/s/r+GI queue...
This paper studies many-server limits for multi-server queues that have a phase-type service time di...
Abstract We propose an analytically tractable approach for studying the transient behavior of multi-...
This paper studies many-server limits for G/Ph/n+M queues, which have a phase-type service time dist...
The performance of a call center is sensitive to customer abandonment. In this survey paper, we focu...
We use a multidimensional diffusion process to approximate the dynamics of aqueue served by many par...
We study G/G/n+GI queues in which customer patience times are independent, identically distributed f...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
Recently, [1] have obtained the transient solution of multi-server queue with balking and reneging. ...
Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier r...
In this paper, we consider time-varying multiserver queues with abandonment and retrials. For their ...
In this paper, we consider modeling time-dependent multi-server queues that include aban-donments an...
We study many-server queues with abandonment in which customers have general service and patience ti...
Insight is provided into a previously developed M/M/s/r+M(n) approximation for the M/GI/s/r+GI queue...
This paper studies many-server limits for multi-server queues that have a phase-type service time di...
Abstract We propose an analytically tractable approach for studying the transient behavior of multi-...
This paper studies many-server limits for G/Ph/n+M queues, which have a phase-type service time dist...
The performance of a call center is sensitive to customer abandonment. In this survey paper, we focu...
We use a multidimensional diffusion process to approximate the dynamics of aqueue served by many par...
We study G/G/n+GI queues in which customer patience times are independent, identically distributed f...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
Recently, [1] have obtained the transient solution of multi-server queue with balking and reneging. ...
Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier r...