Tandem queues with impatient customers

2019 ◽  
Vol 135 ◽  
pp. 102011
Author(s):  
Jianfu Wang ◽  
Hossein Abouee-Mehrizi ◽  
Opher Baron ◽  
Oded Berman
2011 ◽  
Vol 15 (2) ◽  
pp. 423-451 ◽  
Author(s):  
Shaul K. Bar-Lev ◽  
Hans Blanc ◽  
Onno Boxma ◽  
Guido Janssen ◽  
David Perry

2007 ◽  
Vol 22 (1) ◽  
pp. 107-131 ◽  
Author(s):  
Dimitrios G. Pandelis

We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible servers is determined by a transition-monotone policy. Moreover, we present conditions under which the optimal policy can be explicitly determined.


2015 ◽  
Vol 52 (4) ◽  
pp. 941-961 ◽  
Author(s):  
Xiuli Chao ◽  
Qi-Ming He ◽  
Sheldon Ross

In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Both transient and steady state solutions are derived first for Poisson arrivals, and then extended to cases with batch Poisson and nonstationary Poisson arrival processes. Finally, we report several stochastic ordering results on how system performance measures are affected by arrival and service processes.


Sign in / Sign up

Export Citation Format

Share Document