A model for rational abandonments from invisible queues
Queueing Systems: Theory and Applications
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems: Theory and Applications
Admission control policies for two-stage tandem queues with no waiting spaces
Computers and Operations Research
Benefits of providing amenities to impatient waiting customers
Computers and Operations Research
Design of a web site for guaranteed delay and blocking probability bounds
Decision Support Systems
Classifying scheduling policies with respect to higher moments of conditional response time
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Diffusion Approximation for a GI/GI/1 Queue with Balking or Reneging
Queueing Systems: Theory and Applications
Predicting queueing delays for multiclass call centers
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks and ISDN Systems
Optimal Processing Policies for an e-Commerce Web Server
INFORMS Journal on Computing
Contact Centers with a Call-Back Option and Real-Time Delay Information
Operations Research
Stationary delays for a two-class priority queue with impatient customers
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
On the impact of customer balking, impatience and retrials in telecommunication systems
Computers & Mathematics with Applications
Pointwise Stationary Fluid Models for Stochastic Processing Networks
Manufacturing & Service Operations Management
The Impact of Delay Announcements in Many-Server Queues with Abandonment
Operations Research
The impacts of customers’ delay-risk sensitivities on a queue with balking
Probability in the Engineering and Informational Sciences
Managing Service Systems with an Offline Waiting Option and Customer Abandonment
Manufacturing & Service Operations Management
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
User equilibria for a parallel queueing system with state dependent routing
Queueing Systems: Theory and Applications
Degrees of terminal cooperativeness and the efficiency of the barge handling process
Expert Systems with Applications: An International Journal
Call Centers with Delay Information: Models and Insights
Manufacturing & Service Operations Management
The Impact of Delaying the Delay Announcements
Operations Research
Dynamic staffing in a telephone call center aiming to immediately answer all calls
Operations Research Letters
Advertising Strategies in Electronic Retailing: A Differential Games Approach
Information Systems Research
Manufacturing & Service Operations Management
Pricing Time-Sensitive Services Based on Realized Performance
Manufacturing & Service Operations Management
Hi-index | 0.01 |
This paper investigates the effect upon performance in a service system, such as a telephone call center, of giving waiting customers state information. In particular, the paper studies two M/M/s/r queueing models with balking and reneging. For simplicity, it is assumed that each customer is willing to wait a fixed time before beginning service. However, customers differ, so the delay tolerances for successive customers are random. In particular, it is assumed that the delay tolerance of each customer is zero with probability β, and is exponentially distributed with mean α-1 conditional on the delay tolerance being positive. Let N be the number of customers found by an arrival. In Model 1, no state information is provided, so that if N ≥ s, the customer balks with probability β; if the customer enters the system, he reneges after an exponentially distributed time with mean α-1 if he has not begun service by that time. In Model 2, if N - s + k μ s, then the customer is told the system state k and the remaining service times of all customers in the system, so that he balks with probability β + (1 - β)(1 - qk), where qk = P(T > Sk), T is exponentially distributed with mean α-1, Sk is the sum of k + 1 independent exponential random variables each with mean (sμ)-1, and μ-1 is the mean service time. In Model 2, all reneging is replaced by balking. The number of customers in the system for Model 1 is shown to be larger than that for Model 2 in the likelihood-ratio stochastic ordering. Thus, customers are more likely to be blocked in Model 1 and are more likely to be served without waiting in Model 2. Algorithms are also developed for computing important performance measures in these, and more general, birth-and-death models.