CUSUM Statistical Monitoring of M/M/1 Queues and Extensions

被引:11
|
作者
Chen, Nan [1 ]
Zhou, Shiyu [2 ]
机构
[1] Natl Univ Singapore, Dept Ind & Syst Engn, Singapore 117548, Singapore
[2] Univ Wisconsin, Dept Ind & Syst Engn, Madison, WI 53706 USA
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
CUSUM charts; Sampling schemes; Queueing systems; SPC; CHART; DESIGN; MODELS; LENGTH; LINES;
D O I
10.1080/00401706.2014.923787
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Many production and service systems can be modeled as queueing systems. Their operational efficiency and performance are often measured using queueing performance metrics (QPMs), such as average cycle time, average waiting length, and throughput rate. These metrics need to be quantitatively evaluated and monitored in real time to continuously improve the system performance. However, QPMs are often highly stochastic, and hence are difficult to monitor using existing methods. In this article, we propose the cumulative sum (CUSUM) schemes to efficiently monitor the performance of typical queueing systems based on different sampling schemes. We use M/M/1 queues to illustrate how to design the CUSUM chart and compare their performance with several alternative methods. We demonstrate that the performance of CUSUM is superior, responding faster to many shift patterns through extensive numerical studies. We also briefly discuss the extensions of CUSUM charts to more general queues, such as M/G/1, G/G/1, or M/M/c queues. We use case studies to demonstrate the applications of our approach. Supplementary materials for this article are available online.
引用
收藏
页码:245 / 256
页数:12
相关论文
共 50 条
  • [1] SOLUTIONS OF M/G/1//N-TYPE LOOPS WITH EXTENSIONS TO M/G/1 AND GL/M/1 QUEUES
    CARROLL, JL
    VANDELIEFVOORT, A
    LIPSKY, L
    [J]. OPERATIONS RESEARCH, 1982, 30 (03) : 490 - 514
  • [2] M/M/1 queues with working vacations (M/M/1/WV)
    Servi, LD
    Finn, SG
    [J]. PERFORMANCE EVALUATION, 2002, 50 (01) : 41 - 52
  • [3] On M/M/1 queues with a smart machine
    Li, H
    Zhu, YX
    Yang, P
    Madhavapeddy, S
    [J]. QUEUEING SYSTEMS, 1996, 24 (1-4) : 23 - 36
  • [4] On M/M/1 queues with a smart machine
    Wireless Networks, NORTEL, MS-D207, 2201 Lakeside Blvd., Richardson, TX 75083-3871, United States
    [J]. Queueing Syst., 1-4 (23-36):
  • [5] ON THE TRANSIENT-BEHAVIOR OF THE M/M/1 AND M/M/1/K QUEUES
    XIE, SH
    KNESSL, C
    [J]. STUDIES IN APPLIED MATHEMATICS, 1993, 88 (03) : 191 - 240
  • [6] Two M/M/1 Queues with Transfers of Customers
    Qi-Ming He
    Marcel F. Neuts
    [J]. Queueing Systems, 2002, 42 : 377 - 400
  • [7] M/M/1/1 Retrial Queues with Setup Time
    Tuan Phung-Duc
    [J]. QUEUEING THEORY AND NETWORK APPLICATIONS, 2016, 383 : 93 - 104
  • [8] STATE PROBABILITIES OF M/M/1 PRIORITY QUEUES
    MARKS, BI
    [J]. OPERATIONS RESEARCH, 1973, 21 (04) : 974 - 987
  • [9] Two M/M/1 queues with transfers of customers
    He, QM
    Neuts, MF
    [J]. QUEUEING SYSTEMS, 2002, 42 (04) : 377 - 400
  • [10] Strategic joining in M/M/1 retrial queues
    Wang, Jinting
    Zhang, Feng
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 230 (01) : 76 - 87