Pub Date : 2024-01-05DOI: 10.1007/s11134-023-09900-z
Yi Zheng, Juxihong Julaiti, Guodong Pang
{"title":"Adaptive service rate control of an M/M/1 queue with server breakdowns","authors":"Yi Zheng, Juxihong Julaiti, Guodong Pang","doi":"10.1007/s11134-023-09900-z","DOIUrl":"https://doi.org/10.1007/s11134-023-09900-z","url":null,"abstract":"","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"24 17","pages":"1-33"},"PeriodicalIF":1.2,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139383782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-01Epub Date: 2024-09-21DOI: 10.1007/s11134-024-09927-w
Yee Lam Elim Thompson, Gary M Levine, Weijie Chen, Berkman Sahiner, Qin Li, Nicholas Petrick, Jana G Delfino, Miguel A Lago, Qian Cao, Frank W Samuelson
In the past decade, artificial intelligence (AI) algorithms have made promising impacts in many areas of healthcare. One application is AI-enabled prioritization software known as computer-aided triage and notification (CADt). This type of software as a medical device is intended to prioritize reviews of radiological images with time-sensitive findings, thus shortening the waiting time for patients with these findings. While many CADt devices have been deployed into clinical workflows and have been shown to improve patient treatment and clinical outcomes, quantitative methods to evaluate the wait-time-savings from their deployment are not yet available. In this paper, we apply queueing theory methods to evaluate the wait-time-savings of a CADt by calculating the average waiting time per patient image without and with a CADt device being deployed. We study two workflow models with one or multiple radiologists (servers) for a range of AI diagnostic performances, radiologist's reading rates, and patient image (customer) arrival rates. To evaluate the time-saving performance of a CADt, we use the difference in the mean waiting time between the diseased patient images in the with-CADt scenario and that in the without-CADt scenario as our performance metric. As part of this effort, we have developed and also share a software tool to simulate the radiology workflow around medical image interpretation, to verify theoretical results, and to provide confidence intervals for the performance metric we defined. We show quantitatively that a CADt triage device is more effective in a busy, short-staffed reading setting, which is consistent with our clinical intuition and simulation results. Although this work is motivated by the need for evaluating CADt devices, the evaluation methodology presented in this paper can be applied to assess the time-saving performance of other types of algorithms that prioritize a subset of customers based on binary outputs.
{"title":"Applying queueing theory to evaluate wait-time-savings of triage algorithms.","authors":"Yee Lam Elim Thompson, Gary M Levine, Weijie Chen, Berkman Sahiner, Qin Li, Nicholas Petrick, Jana G Delfino, Miguel A Lago, Qian Cao, Frank W Samuelson","doi":"10.1007/s11134-024-09927-w","DOIUrl":"10.1007/s11134-024-09927-w","url":null,"abstract":"<p><p>In the past decade, artificial intelligence (AI) algorithms have made promising impacts in many areas of healthcare. One application is AI-enabled prioritization software known as computer-aided triage and notification (CADt). This type of software as a medical device is intended to prioritize reviews of radiological images with time-sensitive findings, thus shortening the waiting time for patients with these findings. While many CADt devices have been deployed into clinical workflows and have been shown to improve patient treatment and clinical outcomes, quantitative methods to evaluate the wait-time-savings from their deployment are not yet available. In this paper, we apply queueing theory methods to evaluate the wait-time-savings of a CADt by calculating the average waiting time per patient image without and with a CADt device being deployed. We study two workflow models with one or multiple radiologists (servers) for a range of AI diagnostic performances, radiologist's reading rates, and patient image (customer) arrival rates. To evaluate the time-saving performance of a CADt, we use the difference in the mean waiting time between the diseased patient images in the with-CADt scenario and that in the without-CADt scenario as our performance metric. As part of this effort, we have developed and also share a software tool to simulate the radiology workflow around medical image interpretation, to verify theoretical results, and to provide confidence intervals for the performance metric we defined. We show quantitatively that a CADt triage device is more effective in a busy, short-staffed reading setting, which is consistent with our clinical intuition and simulation results. Although this work is motivated by the need for evaluating CADt devices, the evaluation methodology presented in this paper can be applied to assess the time-saving performance of other types of algorithms that prioritize a subset of customers based on binary outputs.</p>","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"108 3-4","pages":"579-610"},"PeriodicalIF":0.7,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11496365/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142506729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-16DOI: 10.1007/s11134-023-09898-4
Ayane Nakamura, Tuan Phung-Duc
{"title":"Exact and asymptotic analysis of infinite server batch service queues with random batch sizes","authors":"Ayane Nakamura, Tuan Phung-Duc","doi":"10.1007/s11134-023-09898-4","DOIUrl":"https://doi.org/10.1007/s11134-023-09898-4","url":null,"abstract":"","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"135 11‐12","pages":""},"PeriodicalIF":1.2,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138966984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-17DOI: 10.1007/s11134-023-09894-8
Herwig Bruneel, Arnaud Devos
Abstract We consider a system of two parallel discrete-time single-server queues, queue 1 and queue 2. The service time of any customer in either queue is equal to 1 time slot. Arrivals during consecutive slots occur independently from slot to slot. However, the arrival streams into both queues are possibly mutually interdependent, i.e., during any slot, the numbers of arrivals in queue 1 and queue 2 need not be statistically independent. Their joint probability generating function (pgf) A ( x , y ) fully characterizes the queueing model. As a consequence of the possible intra-slot correlation in the arrival process, the numbers of customers present (“system contents”) in queues 1 and 2, at any given slot boundary, are not necessarily independent either. In a previous paper, we have already discussed the mathematical difficulty of computing their steady-state joint pgf $$U(z_1,z_2)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>U</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> ; explicit closed-form results can only be obtained for specific choices of A ( x , y ). In this paper, we therefore look at the problem from an other angle. Specifically, we study the (asymptotic) conditional steady-state behavior of the system under the condition that the content of queue 1 is (temporarily) very high (goes to infinity). For ease of terminology, we refer to the system as the “asymptotic system” in these circumstances. We prove that the asymptotic system is nearly identical to the original (unconditional) system, but with a modified joint arrival pgf $$A^*(x,y)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>A</mml:mi> <mml:mo>∗</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> that can be computed explicitly from A ( x , y ). This fundamental result allows us to determine the stability condition of queue 2 in the asymptotic system, and explicitly compute the classical queueing performance metrics of queue 2, such as the pgf, the moments and the approximate tail distribution of its system content, when this condition is fulfilled. It also leads to accurate approximative closed-form expressions for the joint tail distribution of the system contents in both queues, in the original (unconditional) system. We extensively illustrate our methodology by means of various specific (popular) choices of A ( x , y ). In some examples, where an explicit solution for $$U(z_1,z_2)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>U</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <
考虑一个由两个并行的离散时间单服务器队列1和队列2组成的系统。两个队列中任意一个客户的服务时间等于1个时隙。在连续的时段内，每个时段的到达都是独立的。然而，进入两个队列的到达流可能是相互依赖的，即在任何时段，队列1和队列2的到达数不必在统计上独立。它们的联合概率生成函数(pgf) A (x, y)充分表征了排队模型。由于到达过程中可能存在槽内相关性，在任何给定的槽边界上，队列1和队列2中存在的客户数量(“系统内容”)也不一定是独立的。在之前的文章中，我们已经讨论了计算它们的稳态关节pgf $$U(z_1,z_2)$$ U (z1, z2)的数学难度;只有在A (x, y)的特定选择下才能得到显式的封闭结果。因此，在本文中，我们从另一个角度来看待这个问题。具体地说，我们研究了在队列1的内容(暂时)非常高(趋于无穷)的情况下系统的(渐近)条件稳态行为。为了便于术语的使用，在这种情况下，我们将该系统称为“渐近系统”。我们证明了渐近系统与原始(无条件)系统几乎相同，但具有一个修改的联合到达pgf $$A^*(x,y)$$ a∗(x, y)，该联合到达可以从a (x, y)显式计算。这一基本结果使我们能够确定渐近系统中队列2的稳定性条件，并显式地计算出该条件满足时队列2的经典排队性能指标，如pgf、矩和其系统内容的近似尾部分布。它还可以得到原始(无条件)系统中两个队列中系统内容的联合尾部分布的精确近似封闭表达式。我们通过A (x, y)的各种特定(流行)选择来广泛地说明我们的方法。在某些示例中，已知$$U(z_1,z_2)$$ U (z1, z2)或(近似)联合尾分布的显式解，我们可以轻松检索已知结果。在其他情况下，对于到达的pgfs A (x, y)发现了新的结果，直到现在还没有明确的结果。
{"title":"Asymptotic behavior of a system of two coupled queues when the content of one queue is very high","authors":"Herwig Bruneel, Arnaud Devos","doi":"10.1007/s11134-023-09894-8","DOIUrl":"https://doi.org/10.1007/s11134-023-09894-8","url":null,"abstract":"Abstract We consider a system of two parallel discrete-time single-server queues, queue 1 and queue 2. The service time of any customer in either queue is equal to 1 time slot. Arrivals during consecutive slots occur independently from slot to slot. However, the arrival streams into both queues are possibly mutually interdependent, i.e., during any slot, the numbers of arrivals in queue 1 and queue 2 need not be statistically independent. Their joint probability generating function (pgf) A ( x , y ) fully characterizes the queueing model. As a consequence of the possible intra-slot correlation in the arrival process, the numbers of customers present (“system contents”) in queues 1 and 2, at any given slot boundary, are not necessarily independent either. In a previous paper, we have already discussed the mathematical difficulty of computing their steady-state joint pgf $$U(z_1,z_2)$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>U</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> ; explicit closed-form results can only be obtained for specific choices of A ( x , y ). In this paper, we therefore look at the problem from an other angle. Specifically, we study the (asymptotic) conditional steady-state behavior of the system under the condition that the content of queue 1 is (temporarily) very high (goes to infinity). For ease of terminology, we refer to the system as the “asymptotic system” in these circumstances. We prove that the asymptotic system is nearly identical to the original (unconditional) system, but with a modified joint arrival pgf $$A^*(x,y)$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:msup> <mml:mi>A</mml:mi> <mml:mo>∗</mml:mo> </mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> that can be computed explicitly from A ( x , y ). This fundamental result allows us to determine the stability condition of queue 2 in the asymptotic system, and explicitly compute the classical queueing performance metrics of queue 2, such as the pgf, the moments and the approximate tail distribution of its system content, when this condition is fulfilled. It also leads to accurate approximative closed-form expressions for the joint tail distribution of the system contents in both queues, in the original (unconditional) system. We extensively illustrate our methodology by means of various specific (popular) choices of A ( x , y ). In some examples, where an explicit solution for $$U(z_1,z_2)$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>U</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>z</mml:mi> <mml:mn>2</mml:mn> </mml:msub> <","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136033606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-13DOI: 10.1007/s11134-023-09895-7
Krzysztof Dȩbicki, Enkelejd Hashorva, Michel Mandjes
{"title":"Editorial introduction: special issue on Gaussian queues","authors":"Krzysztof Dȩbicki, Enkelejd Hashorva, Michel Mandjes","doi":"10.1007/s11134-023-09895-7","DOIUrl":"https://doi.org/10.1007/s11134-023-09895-7","url":null,"abstract":"","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135855639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-07DOI: 10.1007/s11134-023-09891-x
Somya Mehra, Peter G. Taylor
Abstract In this paper, we consider the occupancy distribution for an open network of infinite server queues with multivariate batch arrivals following a non-homogeneous Poisson process, and general service time distributions. We derive a probability generating function for the transient occupancy distribution of the network and prove that it is necessary and sufficient for ergodicity that the expected occupancy time for each batch be finite. Further, we recover recurrence relations for the transient probability mass function formulated in terms of a distribution obtained by compounding the batch size with a multinomial distribution.
{"title":"Open networks of infinite server queues with non-homogeneous multivariate batch Poisson arrivals","authors":"Somya Mehra, Peter G. Taylor","doi":"10.1007/s11134-023-09891-x","DOIUrl":"https://doi.org/10.1007/s11134-023-09891-x","url":null,"abstract":"Abstract In this paper, we consider the occupancy distribution for an open network of infinite server queues with multivariate batch arrivals following a non-homogeneous Poisson process, and general service time distributions. We derive a probability generating function for the transient occupancy distribution of the network and prove that it is necessary and sufficient for ergodicity that the expected occupancy time for each batch be finite. Further, we recover recurrence relations for the transient probability mass function formulated in terms of a distribution obtained by compounding the batch size with a multinomial distribution.","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135254983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-26DOI: 10.1007/s11134-023-09892-w
Angelos Aveklouris, Amber L. Puha, Amy R. Ward
{"title":"A fluid approximation for a matching model with general reneging distributions","authors":"Angelos Aveklouris, Amber L. Puha, Amy R. Ward","doi":"10.1007/s11134-023-09892-w","DOIUrl":"https://doi.org/10.1007/s11134-023-09892-w","url":null,"abstract":"","PeriodicalId":20813,"journal":{"name":"Queueing Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134885867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号