A model for rational abandonments from invisible queues

Queueing Systems

Volumn 36, Issue 1-3, 2000, Pages 141-173

  Mandelbaum, Avishai ^a   Shimkin, Nahum ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Abandonments; Call centers; Multiserver exponential queues; Nash equilibrium

Indexed keywords

SALES;

ABANDONMENTS; CALL CENTERS; EQUILIBRIUM POINT; FAILURE CONDITIONS; MULTI-SERVER; NASH EQUILIBRIA; PROBLEM FORMULATION; WAITING TIME DISTRIBUTIONS;

QUEUEING THEORY;

EID: 0034339446     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019131203242     Document Type: Article

References (21)

1. E. Altman and N. Shimkin, Individual equilibrium and learning in a processor sharing system, Oper. Res. 46 (1998) 776-784.
2. F. Baccelli and G. Hebuterne, On queues with impatient customers, in: Performance '81, ed. F.J. Kylstra (North-Holland, Amsterdam, 1981) pp. 159-179.
3. A.J. Brigandi, D.R. Dargon, M.J. Sheehan and T. Spencer, AT&T's call processing simulator (CPPS) operational design for in-bound call centers, Interfaces 24(1) (1994) 6-28.
4. Z. Carmon and D. Kahneman, The experienced utility of queuing: Experience profiles and retrospective evaluations of simulated queues, Working paper, Fuqua School Duke University, Durham, NC (1999).
5. J.E. Cohen and F.P. Kelly, A paradox of congestion in a queuing network, J. Appl. Probab. 27 (1990) 730-734.
6. C.F. Daganzo, The uniqueness of a time-dependent equilibrium distribution of arrivals at a single bottleneck, Transport. Sei. 19 (1985) 29-37.
7. O. Garnet, A. Mandelbaum and M. Reiman, Design of large call centers with impatient customers, submitted (1999).
8. R. Hassin and M. Haviv, Equilibrium strategies and the value of information in a two line queueing system with threshold jockeying, Comm. Statist. Stochastic Models 10 (1994) 415-435.
9. R. Hassin and M. Haviv, Equilibrium strategies for queues with impatient customers, Oper. Res. Lett. 17 (1995) 41-45.
10. M. Haviv and Y. Ritov, Homogeneous customers reneg at random times when waiting conditions deteriorate, preprint (August 1999).
11. Help Desk and Customer Support Practices Report, May 1997 surgery results, Help Desk Institute (www.HelpDeskInst.com).
12. M.K. Hui and D.K. Tse, What to tell customers in waits of different lengths: an iterative model of service evaluation, J. Marketing 60 (1996) 81-90.
13. D.L. Iglehart and W. Whitt, Multiple channel queues in heavy traffic, I, Adv. in Appl. Probab. 2 (1979) 150-177.
14. J.F.C. Kingman, The single server queue in heavy traffic, Proc. Cambridge Philos. Soc. 57 (1961) 902-904.
15. S. Li and T. Basar, Distributed algorithms for the computation of noncooperative equilibria, Automatica 23 (1987) 523-533.
16. H. Mendelson and S. Whang, Optimal incentive-compatible priority pricing for the M/M/1 queue, Oper. Res. 33 (1990) 870-883.
17. C. Palm, Methods of judging the annoyance caused by congestion, Tele 2 (1953) 1-20.
18. J.B. Rosen, Existence and uniqueness of equilibrium points for concave N-person games, Econometrica 33 (1965) 520-53 4.
19. C.M. Rump and S. Stidham, Stability and chaos in input pricing for a service facility with adaptive customer response to congestion, Managm. Sci. 44 (1998) 246-261.
20. M.J. Smith, The existence of a time-dependent equilibrium distribution of arrivals at a single bottleneck, Transport. Sci. 18 (1984) 385-394.
21. W. Whitt, Improving service by informing customers about anticipated delays, Managm. Sci. 45(2) (1999) 192-207.