Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-28T17:24:55.788Z Has data issue: false hasContentIssue false
  • English
  • Français

WAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERS

Published online by Cambridge University Press:  28 March 2013

Vahid Sarhangian  and
Bariş Balciog̃lu
Vahid Sarhangian
Affiliation:
Joseph L. Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, M5S 3E6, Canada E-mail: [email protected]
Bariş Balciog̃lu
Affiliation:
Faculty of Engineering and Natural Sciences, Sabancı University, Orhanlı-Tuzla, 34956 Istanbul, Turkey E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed patience limits expire. The second system comprises parallel and identical servers providing the same type of service for both classes of impatient customers under the non-preemptive priority policy. We assume exponential service times and consider two cases depending on the time-to-abandon distribution being exponentially distributed or deterministic. In either case, we permit different reneging rates or patience limits for each class. Finally, we consider the first-come-first-served policy in single- and multi-server settings. In all models, we obtain the Laplace transform of the virtual waiting time for each class by exploiting the level-crossing method. This enables us to compute the steady-state system performance measures.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 27 , Issue 3 , July 2013 , pp. 333 - 352
Copyright
Copyright © Cambridge University Press 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Abate, J. & Whitt, W. (1995). Numerical inversion of Laplace transforms of probability distributions. ORSA Journal of Computing 7: 36–43.CrossRefGoogle Scholar
2.Ahghari, M. & Balcıog̃lu, B. (2009). Benefits of cross-training in a skill-based routing contact center with priority queues and impatient customers. IIE Transaction 41: 524–536.CrossRefGoogle Scholar
3.Baccelli, F. & Hebuterne, G. (1981). On queues with impatient customers. In Performance ’81. Kylstra, F.J. (ed.), North Holland, Amsterdam: pp. 159–179.Google Scholar
4.Baccelli, F., Boyer, P., & Hebuterne, G. (1984). Single-server queues with impatient customers. Advanve Applied Probability 16: 887–905.CrossRefGoogle Scholar
5.Boots, N.K. & Tijms, H. (1999). A multiserver queueing system with impatient customers. Management Science 45: 444–448.CrossRefGoogle Scholar
6.Boxma, O., Perry, D., Stadje, W., & Zacks, S. (2010). The busy period of an M/G/1 queue with customer impatience. Journal of Applied Probability 47: 130–145.CrossRefGoogle Scholar
7.Brandt, A. & Brandt, M. (1999). On a two-queue priority system with impatience and its applications to a call center. Methodology and Computing in Applied Probability 1: 191–210.CrossRefGoogle Scholar
8.Brandt, A. & Brandt, M. (2004). On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers. Queueing Systems 47: 147–168.CrossRefGoogle Scholar
9.Brill, P.H. (1975). System Point Theory in Exponential Queues, PhD Thesis, Department of Industrial Engineering, University of Toronto.Google Scholar
10.Brill, P.H. & Posner, M.J.M. (1977). Level crossings in point processes applied to queues: Single-server case. Operations Research 25: 662–674.CrossRefGoogle Scholar
11.Brill, P.H. (1979). An embedded level crossing technique for dams and queues. Journal of Applied Probability 16: 174–186.CrossRefGoogle Scholar
12.Brill, P.H. (2008). Level crossing methods in stochastic models, Springer.CrossRefGoogle Scholar
13.Choi, B.D., Kim, B., & Chung, J. (2001). M/M/1 queue with impatient customers of higher priority. Queueing Systems 38: 49–66.CrossRefGoogle Scholar
14.Cohen, J.W. (1977). On up- and downcrossings. Journal of Applied Probability 4: 405–410.CrossRefGoogle Scholar
15.Cohen, J.W. & Rubinovitch, M. (1977). On level crossings and cycles in dam processes. Mathematics of Operations Research 2: 297–310.CrossRefGoogle Scholar
16.Daley, D.J. (1965). General customer impatience in the queue GI/G/1. Journal of Applied Probability 2: 186–205.CrossRefGoogle Scholar
17.Daley, D.J. & Servi, L.D. (1998). Idle and busy periods in stable M/M/k queues. Journal of Applied Probability 35: 950–962.CrossRefGoogle Scholar
18.Ho, T. & Zheng, Y.S. (2004). Setting customer expectations in service delivery: An integrated marketing-operations perspective. Management Science 50: 479–488.CrossRefGoogle Scholar
19.Iravani, F. & Balcıog̃lu, B. (2008a). Approximations for the M/GI/N+GI type call center. Queueing Systems 58: 137–153.CrossRefGoogle Scholar
20.Iravani, F. & Balcıoğlu, B. (2008b). On priority queues with impatient customers. Queueing Systems 58: 239–260.CrossRefGoogle Scholar
21.Jagerman, D.L. (1982). An inversion technique for the Laplace transform. Bell System Technical Journal 61: 1995–2002.CrossRefGoogle Scholar
22.Jagerman, D.L. (2000). Difference equations with applications to queues, New York: Marcel Dekker, Inc.CrossRefGoogle Scholar
23.Jouini, O. & Dallery, Y. (2007). Stationary delays for a two-class priority queue with impatient customers. Proceedings of the 2nd International Conference on Performance Evaluation Methodologies and Tools, Nantes, France.CrossRefGoogle Scholar
24.Kleinrock, L. (1975). Queueing systems volume I: theory, New York: John Wiley & Sons.Google Scholar
25.Liu, L. & Kulkarni, V.G. (2008). Busy period analysis for M/PH/1 queues with workload dependent balking. Queuing Systems 59: 37–51.CrossRefGoogle Scholar
26.Liu, L. & Kulkarni, V.G. (2008). Balking and reneging in M/G/s system exact analysis and approximations. Probability in the Engineering and Informational Sciences 22: 355–371.CrossRefGoogle Scholar
27.Milner, J.M. & Olsen, T.L. (2008). Service level agreements in call centers: perils and prescriptions. Management Science 54: 238–252.CrossRefGoogle Scholar
28.Palm, C. (1953). Methods of judging the annoyance caused by congestion. Tele 2: 1–20.Google Scholar
29.Perry, D. & Asmussen, S. (1995). Rejection rules in the M/G/1 queue. Queueing Systems 19: 105–130.CrossRefGoogle Scholar
30.Rao, S.S. (1967). Queueing with balking and reneging in M/G/1 systems. Metrika 12: 173–188.Google Scholar
31.Rozenshmidt, L. (2008). On priority queues with impatient customers: stationary and time-varying analysis. Master's Thesis, Technion - Israel Institute of Technology, Haifa, Israel.Google Scholar
32.Shantikumar, J.G. (1981). On level crossing analysis of queues. The Australian Journal of Statistics 23: 337–342.CrossRefGoogle Scholar
33.Saltzman, S.M. & Mehrotra, V. (2001). A call center uses simulation to drive strategic change. Interfaces 31: 87–101.CrossRefGoogle Scholar
34.Stanford, R.E. (1979). Reneging phenomenon in single channel queues. Mathematics of Operations Research 4: 162–178.CrossRefGoogle Scholar
35.Stolletz, R. & Helber, S. (2004). Performance analysis of an inbound call center with skills-based routing. OR Spectrum 26: 331–352.CrossRefGoogle Scholar
36.Takács, L. (1974). A single server queue with limited virtual waiting time. Journal of Applied Probability 11: 612–617.CrossRefGoogle Scholar
37.Talreja, R. & Whitt, W. (2008). Fluid models for overloaded multiclass many-server queueing systems with first-come, first-served routing. Management Science 54: 1513–1527.CrossRefGoogle Scholar
38.Wang, Q. (2004). Modeling and analysis of high risk patient queues. European Journal of Operational Research 155: 502–515.CrossRefGoogle Scholar
39.Xiong, W., Jagerman, D.L., & Altiok, T. (2008). M/G/1 queue with deterministic reneging times. Performance Evaluation 65: 308–316.CrossRefGoogle Scholar
40.Zeltyn, S. & Mandelbaum, A. (2005). Call centers with impatient customers: many-server asymptotics of the M/M/n+G queue. Queueing Systems 51: 361–402.CrossRefGoogle Scholar