[1] Song Minshan, Zhang Yulin,. Appointment scheduling with customer impatiencebased on operating cost model [J]. Journal of Southeast University (English Edition), 2019, 35 (2): 252-256. [doi:10.3969/j.issn.1003-7985.2019.02.016]

Copy

Appointment scheduling with customer impatiencebased on operating cost model()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

35

Issue:

2019 2

Page:

252-256

Research Field:

Economy and Management

Publishing date:

2019-06-30

Info

Title:

Appointment scheduling with customer impatiencebased on operating cost model

Author(s):

Song Minshan¹;  2;  Zhang Yulin¹

¹School of Economics and Management, Southeast University, Nanjing 211189, China
²School of Science, Jiangsu University of Science and Technology, Zhenjiang 212003, China

Keywords:

appointment;  customer impatience;  queueing theory;  single server

PACS:

F224

DOI:

10.3969/j.issn.1003-7985.2019.02.016

Abstract:

An appointment scheduling problem is studied with the consideration of customer impatience. On the assumption that both the time of leaving queue and the time of service are exponentially distributed, in order to minimize the joint cost, the optimal appointment schedule of the fixed number of customers is studied. The joint cost function is composed of customers’ expected delay time and service availability time. The expected delay time of each customer in the queue is recursively computed in terms of customer interarrival time. Furthermore, the effect of impatience on the optimal schedule as well as the total operating cost is studied. The results show that as the impatience rate increases, the optimal interarrival time becomes shorter and the interarrival time of the last few customers gradually approaches that of the customers in the middle. In addition, impatient behaviors can increase the joint cost.

References:

[1] Bailey N T J. A study of queues and appointment systems in hospitalout-patient departments, with special reference to waiting-times[J]. Journal of the Royal Statistical Society: Series B (Methodological), 1952, 14(2):185-199.DOI:10.1111/j.2517-6161.1952.tb00112.x.
[2] Wang P P. Static and dynamic scheduling of customer arrivals to a single-server system[J]. Naval Research Logistics, 1993, 40(3):345-360.DOI:10.1002/1520-6750(199304)40:3345::aid-nav3220400305>3.0.co;2-n.
[3] Kuiper A, Kemper B, Mandjes M. A computational approach to optimized appointment scheduling[J]. Queueing Systems, 2015, 79(1):5-36.DOI:10.1007/s11134-014-9398-6.
[4] Zhang Y L, Shen S Q, Erdogan S A. Distributionally robust appointment scheduling with moment-based ambiguity set[J]. Operations Research Letters, 2017, 45(2):139-144.DOI:10.1016/j.orl.2017.01.010.
[5] Liu N. Optimal choice for appointment scheduling window under patient no-show behavior[J]. Production and Operations Management, 2016, 25(1):128-142.DOI:10.1111/poms.12401.
[6] Jiang B W, Tang J F, Yan C J. A stochastic programming model for outpatient appointment scheduling considering unpunctuality[J]. Omega, 2019, 82:70-82.DOI:10.1016/j.omega.2017.12.004.
[7] Movaghar A. On queueing with customer impatience until the beginning of service[J]. Queueing Systems, 1998, 29(2/3/4):337-350.
[8] Choi B D, Kim B, Chung J. M/M/1 queue with impatient customers of higher priority[J]. Queueing Systems, Theory and Applications, 2001, 38(1):49-66.DOI:10.1023/A:1010820112080.
[9] Daley D J. General customer impatience in the queue GI/G/1[J]. Journal of Applied Probability, 1965, 2(1):186-205.DOI:10.2307/3211884.
[10] Choi B D, Kim B, Zhu D B. MAP/M/c queue with constant impatient time[J]. Mathematics of Operations Research, 2004, 29(2):309-325.DOI:10.1287/moor.1030.0081.
[11] Sakuma Y, Takine T. Multi-class M/PH/1 queues with deterministic impatience times[J]. Stochastic Models, 2017, 33(1):1-29.DOI:10.1080/15326349.2016.1197778.
[12] Wang F, Wu X Y. On the waiting time for a M/M/1 queue with impatience [EB/OL].(2017-04-06)[2019-05-23]. https://arxiv.org/abs/1704.01709.
[13] Neuts M F. Matrix-geometric solutions in stochastic models: An algorithmic approach[M]. Courier Corporation, 1994:1-36.

Memo

Memo:

Biographies: Song Minshan(1986—), female, Ph.D. candidate; Zhang Yulin(corresponding author), male, doctor, professor, zhangyl@seu.edu.cn.
Foundation items: The National Natural Science Foundation of China(No.71671036), the Scientific Innovation Research of Graduate Students in Jiangsu Province(No.KYLX_0211).
Citation: Song Minshan, Zhang Yulin.Appointment scheduling with customer impatience based on operating cost model [J].Journal of Southeast University(English Edition), 2019, 35(2):252-256.DOI:10.3969/j.issn.1003-7985.2019.02.016.

Common functions