z-logo
open-access-imgOpen Access
Analysis and Comparison of Queues with Different Levels of Delay Information
Author(s) -
Pengfei Guo,
Paul Zipkin
Publication year - 2007
Publication title -
management science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 4.954
H-Index - 255
eISSN - 1526-5501
pISSN - 0025-1909
DOI - 10.1287/mnsc.1060.0686
Subject(s) - computer science , queue , key (lock) , service (business) , information system , poisson distribution , quality of service , quality (philosophy) , information quality , operations research , computer network , computer security , statistics , mathematics , business , electrical engineering , engineering , philosophy , epistemology , marketing
Information about delays can enhance service quality in many industries. Delay information can take many forms, with different degrees of precision. Different levels of information have different effects on customers and therefore on the overall system. To explore these effects, we consider a queue with balking under three levels of delay information: no information, partial information (the system occupancy), and full information (the exact waiting time). We assume Poisson arrivals, independent exponential service times, and a single server. Customers decide whether to stay or balk based on their expected waiting costs, conditional on the information provided. We show how to compute the key performance measures in the three systems, obtaining closed-form solutions for special cases. We then compare the three systems. We identify some important cases where more accurate delay information improves performance. In other cases, however, information can actually hurt the provider or the customers.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom