Data analytics in the practice of Emergency Medicine
|
|
- Megan Weaver
- 5 years ago
- Views:
Transcription
1 Data analytics in the practice of Emergency Medicine Devashish Das Industrial and Management Systems Engineering University of South Florida November 16, 2018
2 Outline Healthcare systems engineering in ED Emergency medicine at Mayo Clinic Functional regression based monitoring of service systems Conclusions and future work Healthcare systems engineering in ED 2
3 Increasing healthcare cost in the US % of GDP year Healthcare systems engineering in ED 3
4 Overcrowding in the Emergency Department (ED) Emergency Departments are the front-door to healthcare systems, especially for low-income and uninsured population. Over half of the 35.4 million annual inpatient admissions the US begin in the emergency department. 1 Yet, yet more than 5 times as many ED visits are treated and released Healthcare systems engineering in ED 4
5 Outline Healthcare systems engineering in ED Emergency medicine at Mayo Clinic Functional regression based monitoring of service systems Conclusions and future work Emergency medicine at Mayo Clinic 5
6 Mayo Clinic emergency department Level I trauma center in Rochester, Minnesota About 50,000 patients per year in 51 bed facility Emergency medicine at Mayo Clinic 6
7 New technologies to monitor ED performance Electronic dashboard throughout the ED: A multi-patient management system Active RFID tags Emergency medicine at Mayo Clinic 7
8 Optimizing staffing Matching arrival to staffing levels 3 3 Optimization of Multidisciplinary Staffing Improves Patient Experiences at the Mayo Clinic MY Sir, D Nestler, T Hellmich, D Das, MJ Laughlin Jr, MC Dohlman,... Interfaces 47 (5), Wagner prize finalist Emergency medicine at Mayo Clinic 8
9 Improvement in key performance metrics Emergency medicine at Mayo Clinic 9
10 Next steps How to determine if the system is still performing as expected? How to improve the experience individual patient of individual patients? Emergency medicine at Mayo Clinic 10
11 Outline Healthcare systems engineering in ED Emergency medicine at Mayo Clinic Functional regression based monitoring of service systems Conclusions and future work Functional regression based monitoring of service systems 11
12 Simulation and queuing theory Approximate and asymptotic analysis Optimizing the number of servers 4 Non-stationary queues 5 Small ED Pods Discharge/Admit 4 W. A. Massey, The analysis of queues with time-varying rates for telecommunication models, Telecommunication Systems, vol. 21, no. 2-4, pp , O. B. Jennings, A. Mandelbaum, W. A. Massey, and W. Whitt, Server staffing to meet time-varying demand, Management Science, vol. 42, no. 10, pp , Functional regression based monitoring of service systems 12
13 Integrating large scale data Service systems collect vast amounts of performance metric data Stochastic modeling and simulation can be viewed as a forward model, i.e. the intent is to come up with a model that approximates the real data Lack of an inverse modeling approach - Statistically infer the stochastic models from data Disciplined use of available data General purpose - Models can be used in different settings Functional regression based monitoring of service systems 13
14 Existing work on monitoring service systems Limited to M/M/n queues Focus on queue length monitoring 6 No known work on monitoring non-stationary queues 7,8 6 U. N. Bhat and S. S. Rao, A statistical technique for the control of traffic intensity in the queuing systems m/g/1 and g/m/1, Operations Research, vol. 20, no. 5, pp , N. Chen, Y. Yuan, and S. Zhou, Performance analysis of queue length monitoring of m/g/1 systems, Naval Research Logistics (NRL), vol. 58, no. 8, pp , N. Chen and S. Zhou, Cusum statistical monitoring of m/m/1 queues and extensions, Technometrics, vol. 57, no. 2, pp , Functional regression based monitoring of service systems 14
15 Statistical learning framework Predictor: Arrival intensity function λ(t) Response: Departure intensity function δ(t) Arrival rate arrival rate t Departure rate departure rate t Figure: Historical arrival and departure rates Functional regression based monitoring of service systems 15
16 Statistical learning framework Predictor: Arrival intensity function λ(t) Response: Departure intensity function δ(t) Arrival rate arrival rate λ(t) departure rate t Departure rate t Figure: Historical arrival and departure rates Black box: functional regression E (δ(t) λ(t)) Functional regression based monitoring of service systems 15
17 Statistical monitoring framework 9 ( 2 Generate alarm when ˆδ E δ ˆλ) threshold expected actual δ t 8 Das, Devashish and Pasupathy, Kalyan S. and Storlie, Curtis B. and Sir, Mustafa Y. (2018) Functional regression-based monitoring of quality of service in hospital emergency departments, IISE Transactions Functional regression based monitoring of service systems 16
18 Estimating intensity of inhomogeneous Poisson processes 10 τ i,1, τ i,2,... τ i,ni and ν i,1, ν i,2,... ν i,mi arrival and departure time stamps on day i ( N i ) T L(λ i ) λ i (τ i,j ) exp λ(t) dt, j=1 λ(t) = Cf(t), such that f(t)dt = 1 Maximum likelihood estimate of C is N i. Estimation of f(t) is equivalent to kernel density estimation 9 Wu et. al. (2013) ˆλ i (t) = N i j=1 1 w s K s 0 ( ) t τi,j Functional regression based monitoring of service systems 17 w s
19 Estimation of coefficient function Coefficient function β(s, t) is estimated by minimizing difference between expected and observed departure rate from in-control data. min β = min β T i I 0 0 T i I 0 0 ) 2 (ˆδi (t) E(ˆδ i (t) ˆλ i (t)) dt ( 2 t ˆδ i (t) β(s, t)ˆλ i (s)ds) dt. 0 (t T ) Functional regression based monitoring of service systems 18
20 Estimation of coefficient function Coefficient function β(s, t) is estimated by minimizing difference between expected and observed departure rate from in-control data. Challenges: min β = min β Computation T i I 0 0 T i I 0 Nonnegative intensity function Avoid over-fitting 0 ) 2 (ˆδi (t) E(ˆδ i (t) ˆλ i (t)) dt ( 2 t ˆδ i (t) β(s, t)ˆλ i (s)ds) dt. 0 (t T ) Functional regression based monitoring of service systems 18
21 Estimation of coefficient function Therefore β(s, t) can be approximated using kernel functions as follows: with b p 0. P p=1 b p 1 ω K ( s sp ω ) 1 ω K ( t tp ω ), (sp, tp) domain of β(s, t) T T t T s T Functional regression based monitoring of service systems 19
22 Estimation of coefficient function Penalize curvature min b T i I 0 0 φ ( 2 t ˆδ i(t) β(s, t)ˆλ i(s)ds) dt+ 0 (t T ) ( ) 2 2 ( ) β(s, t) 2 2 β(s, t) + dsdt s 2 Proposition 1 For K(u) = 3 4 (1 u2 )I u 1, the least square minimization problem reduces to a quadratic program t 2 min b b T (X T X + Φ)b 2y T Xb + y T y, such that b 0. Functional regression based monitoring of service systems 20
23 Estimation of coefficient function Proposition 2 For proper choice of (s p s q)/ω, optimization problem in Result 1 is strictly convex minimization problem. For Epanechikov s kernel (s p s q)/ω > 0.85 (s4, t4) (s5, t5) (s4, t4) (s5, t5) t (s2, t2) (s3, t3) t (s2, t2) (s3, t3) (s1, t1) (s1, t1) s s (a) (b) Functional regression based monitoring of service systems 21
24 Relationship with infinite server queues Lemma 1 Then, Let λ(t) be the arrival rate to a M t /G t / queue, g(s, t) be the density function of the service time for arrival occurring at time t. and β(s, t) = g(t s, s). Eδ(t) λ(t) = t β(s, t)λ(s)ds Functional regression based monitoring of service systems 22
25 Functional regression based monitoring scheme 1: procedure Phase I of SPC scheme 2: Collect the arrival and departure time instance, τ i,1, τ i,2,... τ i,ni and ν i,1, ν i,2,... ν i,mi, when the system was in-control. 3: Estimate β(s, t). 4: Monitoring statistic e i = T (ˆδi (t) ) 2 ˆβ(s, t)ˆλi (t)ds 0 dt for in-control sample 5: Either use simulation or bootstrapping to estimate h such that P(e i > h) = α 6: procedure Phase II of SPC scheme 7: Collect test sample i I 1. 8: if e i h then 9: sample i is out of control Functional regression based monitoring of service systems 23
26 Simulation model λ(t) t (hour of the day) Figure: Arrival intensity function for simulation case studies Simulate infinite server queues with time varying arrival Arriving entities experience time varying service time distributions Functional regression based monitoring of service systems 24
27 Performance comparison - I Figure: Type II error rate - M t/m/ (µ 0 = 1 hours) FR: Functional regression based monitoring scheme IS: exact calculation based on infinite server lemma Shewhart: x chart for mean service times Functional regression based monitoring of service systems 25
28 Performance comparison - II Figure: Type II error rate - M t/m/ mean service time in control out of contorl D time of the day Figure: Illustration of service time distribution Functional regression based monitoring of service systems 26
29 Performance comparison - III Figure: Type II error rate - M t/m t/ mean service time 1.0 D in control out of contorl D 12 time of the day Figure: Illustration of service time distribution Functional regression based monitoring of service systems 27
30 Infinite server for determining staffing levels number of server D t Figure: Shift in optimal staffing Functional regression based monitoring of service systems 28
31 Detecting changes in staffing Table: Type II error rate for detecting shift in staffing D (hours) FR chart Shewhart Chart Functional regression based monitoring of service systems 29
32 Case Study: Mayo Clinic s ED training - data from 2013, test data - March 2014 Test statistic Test statistic day day (a) (b) Figure: Data from March Monitoring statistic and signaling threshold for (a) functional regression based SPC scheme and (b) Shewhart chart. Functional regression based monitoring of service systems 30
33 Discussion on out of control days March 8, 12, 31 - out-of-control by SH chart. On March 8 and March 12 the length of stay was 2.82 hours and 4.45 hours. On March 21, LOS was 3.8 hours But FR chart signals March 14, 21, 22, 23 and 31 as out-of-control. δ(t) actual δ(t) expected δ(t) t Figure: Departure intensity on March 21 Functional regression based monitoring of service systems 31
34 Outline Healthcare systems engineering in ED Emergency medicine at Mayo Clinic Functional regression based monitoring of service systems Conclusions and future work Conclusions and future work 32
35 Sequence of event occurring during a patient s visit Problem: Define a timeliness of care metric based on a sequence of events occurring during a patient s visit to the ED. Nurse Arrival Doctor Lab values Discharge / Admit time Conclusions and future work 33
36 Real-time monitoring Monitoring Statistic time SPC Test data In control data set Figure: Monitoring CTMCs Conclusions and future work 34
37 Stochastic filtering and smoothing queuing processes Smoothing Problem: For given arrival time stamps τ i,1, τ i,2,... τ i,ni, simulate departure time stamps ν i,1, ν i,2,... ν i,mi. Filtering Problem: For given arrival time stamps τ i,1, τ i,2,... τ i,ni t, simulate departure time stamps ν i,1, ν i,2,... ν i,mi > t. Model free optimal co Problem: For given arrival time stamps τ i,1, τ i,2,... τ i,ni t, simulate departure time stamps ν i,1, ν i,2,... ν i,mi > t. Conclusions and future work 35
38 Thank you Conclusions and future work 36
Statistical Monitoring of Queuing Networks
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School October 2018 Statistical Monitoring of Queuing Networks Yaren Bilge Kaya University of South Florida, yarenbilgekaya@gmail.com
More informationContinuous-Time Markov Chain
Continuous-Time Markov Chain Consider the process {X(t),t 0} with state space {0, 1, 2,...}. The process {X(t),t 0} is a continuous-time Markov chain if for all s, t 0 and nonnegative integers i, j, x(u),
More informationOnline Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates
Online Supplement to Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates Xu Sun and Ward Whitt Department of Industrial Engineering and Operations Research, Columbia University
More informationAN INFINITE SERVER QUEUEING MODEL WITH VARYING ARRIVAL AND DEPARTURES RATES FOR HEALTHCARE SYSTEM
International Journal of Pure and Applied Mathematics Volume 113 No. 5 2017, 583-593 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v113i5.6
More informationL = λ W time average number in Line or system arrival rate W average Waiting time per customer
IEOR 4615, Lecture 3, January 27, 2015 L λ Little s Law* L = λ W time average number in Line or system arrival rate W average Waiting time per customer *J. D. C. Little, A proof of the queueing formula:
More informationAppendix. A. Simulation study on the effect of aggregate data
36 Article submitted to Operations Research; manuscript no. Appendix A. Simulation study on the effect of aggregate data One of the main limitations of our data are that they are aggregate at the annual
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationDynamic Control of a Tandem Queueing System with Abandonments
Dynamic Control of a Tandem Queueing System with Abandonments Gabriel Zayas-Cabán 1 Jungui Xie 2 Linda V. Green 3 Mark E. Lewis 1 1 Cornell University Ithaca, NY 2 University of Science and Technology
More informationQueues in Hospitals: Queueing Networks with ReEntering Customers in the QED Regime
Queues in Hospitals: Queueing Networks with ReEntering Customers in the QED Regime QED = Quality- and Efficiency-Driven Galit Bracha Yom-Tov Queues in Hospitals: Stochastic Networks with ReEntering Customers
More informationOverflow Networks: Approximations and Implications to Call-Center Outsourcing
Overflow Networks: Approximations and Implications to Call-Center Outsourcing Itai Gurvich (Northwestern University) Joint work with Ohad Perry (CWI) Call Centers with Overflow λ 1 λ 2 Source of complexity:
More informationLecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits. IEOR 4615: Service Engineering Professor Whitt February 19, 2015
Lecture 9: Deterministic Fluid Models and Many-Server Heavy-Traffic Limits IEOR 4615: Service Engineering Professor Whitt February 19, 2015 Outline Deterministic Fluid Models Directly From Data: Cumulative
More informationStein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions
Stein s Method for Steady-State Approximations: Error Bounds and Engineering Solutions Jim Dai Joint work with Anton Braverman and Jiekun Feng Cornell University Workshop on Congestion Games Institute
More informationNew Perspectives on the Erlang-A Queue
New Perspectives on the Erlang-A Queue arxiv:1712.8445v1 [math.pr] 22 Dec 217 Andrew Daw School of Operations Research and Information Engineering Cornell University 257 Rhodes Hall, Ithaca, NY 14853 amd399@cornell.edu
More informationTHIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji
THIELE CENTRE for applied mathematics in natural science The M/M/1 queue with inventory, lost sale and general lead times Mohammad Saffari, Søren Asmussen and Rasoul Haji Research Report No. 11 September
More informationAsymptotic Coupling of an SPDE, with Applications to Many-Server Queues
Asymptotic Coupling of an SPDE, with Applications to Many-Server Queues Mohammadreza Aghajani joint work with Kavita Ramanan Brown University March 2014 Mohammadreza Aghajanijoint work Asymptotic with
More informationMODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS
MODELING WEBCHAT SERVICE CENTER WITH MANY LPS SERVERS Jiheng Zhang Oct 26, 211 Model and Motivation Server Pool with multiple LPS servers LPS Server K Arrival Buffer. Model and Motivation Server Pool with
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationAAMC s Approach to Managing Patient Throughput. Barbara S Jacobs, MSN, RN-BC, NEA-BC, CCRN-K, Chief Nursing Officer
AAMC s Approach to Managing Patient Throughput Barbara S Jacobs, MSN, RN-BC, NEA-BC, CCRN-K, Chief Nursing Officer Our Original State June 2016 375 Licensed beds 97,000 Emergency Department visits per
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More informationSimulating a Medical Observation Unit for a Pediatric Emergency Department. Mark Grum July 29 th, 2015
Simulating a Medical Observation Unit for a Pediatric Emergency Department Mark Grum July 29 th, 2015 Acknowledgements Amy Cohn, Ph.D Gabriel Zayas-Caban, Ph.D Michelle Macy, MD Allison Cator, MD Hassan
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationQuality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis
Quality of Real-Time Streaming in Wireless Cellular Networs : Stochastic Modeling and Analysis B. Blaszczyszyn, M. Jovanovic and M. K. Karray Based on paper [1] WiOpt/WiVid Mai 16th, 2014 Outline Introduction
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationThe Offered-Load Process: Modeling, Inference and Applications. Research Thesis
The Offered-Load Process: Modeling, Inference and Applications Research Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Statistics Michael Reich Submitted
More informationWaiting Time Analysis of A Single Server Queue in an Out- Patient Clinic
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 54-58 www.iosrjournals.org Waiting Time Analysis of A Single Server Queue in
More informationIntroduction to Queueing Theory with Applications to Air Transportation Systems
Introduction to Queueing Theory with Applications to Air Transportation Systems John Shortle George Mason University February 28, 2018 Outline Why stochastic models matter M/M/1 queue Little s law Priority
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationQ = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationMaximizing throughput in zero-buffer tandem lines with dedicated and flexible servers
Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers Mohammad H. Yarmand and Douglas G. Down Department of Computing and Software, McMaster University, Hamilton, ON, L8S
More informationOperations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationOnline Supplement: Managing Hospital Inpatient Bed Capacity through Partitioning Care into Focused Wings
Online Supplement: Managing Hospital Inpatient Bed Capacity through Partitioning Care into Focused Wings Thomas J. Best, Burhaneddin Sandıkçı, Donald D. Eisenstein University of Chicago Booth School of
More informationEXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY
EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 011 MODULE 3 : Stochastic processes and time series Time allowed: Three Hours Candidates should answer FIVE questions. All questions carry
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationADMISSION CONTROL IN THE PRESENCE OF PRIORITIES: A SAMPLE PATH APPROACH
Chapter 1 ADMISSION CONTROL IN THE PRESENCE OF PRIORITIES: A SAMPLE PATH APPROACH Feng Chen Department of Statistics and Operations Research University of North Carolina at Chapel Hill chenf@email.unc.edu
More informationThe effect of probabilities of departure with time in a bank
International Journal of Scientific & Engineering Research, Volume 3, Issue 7, July-2012 The effect of probabilities of departure with time in a bank Kasturi Nirmala, Shahnaz Bathul Abstract This paper
More informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
More informationA Semi-parametric Bayesian Framework for Performance Analysis of Call Centers
Proceedings 59th ISI World Statistics Congress, 25-30 August 2013, Hong Kong (Session STS065) p.2345 A Semi-parametric Bayesian Framework for Performance Analysis of Call Centers Bangxian Wu and Xiaowei
More informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationA monotonic property of the optimal admission control to an M/M/1 queue under periodic observations with average cost criterion
A monotonic property of the optimal admission control to an M/M/1 queue under periodic observations with average cost criterion Cao, Jianhua; Nyberg, Christian Published in: Seventeenth Nordic Teletraffic
More informationDELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS. Rouba Ibrahim Ward Whitt
Proceedings of the 21 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. DELAY PREDICTORS FOR CUSTOMER SERVICE SYSTEMS WITH TIME-VARYING PARAMETERS Rouba
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationI, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.
A BRIEF REVIEW ON INFINITE QUEUE MODEL M. Vasuki*, A. Dinesh Kumar** & G. Vijayaprabha** * Assistant Professor, Department of Mathematics, Srinivasan College of Arts and Science, Perambalur, Tamilnadu
More informationQueuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011
Queuing Theory Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Queuing Theory STAT 870 Summer 2011 1 / 15 Purposes of Today s Lecture Describe general
More informationData-Based Resource-View of Service Networks: Performance Analysis, Delay Prediction and Asymptotics. PhD Proposal. Nitzan Carmeli.
Data-Based Resource-View of Service Networks: Performance Analysis, Delay Prediction and Asymptotics PhD Proposal Nitzan Carmeli Advisers: Prof. Avishai Mandelbaum Dr. Galit Yom-Tov Technion - Israel Institute
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationMoment-based Availability Prediction for Bike-Sharing Systems
Moment-based Availability Prediction for Bike-Sharing Systems Jane Hillston Joint work with Cheng Feng and Daniël Reijsbergen LFCS, School of Informatics, University of Edinburgh http://www.quanticol.eu
More informationUSING DIFFERENT RESPONSE-TIME REQUIREMENTS TO SMOOTH TIME-VARYING DEMAND FOR SERVICE
USING DIFFERENT RESPONSE-TIME REQUIREMENTS TO SMOOTH TIME-VARYING DEMAND FOR SERVICE by Ward Whitt 1 AT&T Labs September 9, 1997 Revision: November 20, 1998 Operations Research Letters 24 (1999) 1 10 1
More informationPerformance Analysis of Queue Length Monitoring of M/G/1 Systems
Performance Analysis of Queue Length Monitoring of M/G/1 Systems Nan Chen, 1 Yuan Yuan, 2 Shiyu Zhou 2 1 Department of Industrial and Systems Engineering, National University of Singapore, Singapore 2
More informationIntegrated Likelihood Estimation in Semiparametric Regression Models. Thomas A. Severini Department of Statistics Northwestern University
Integrated Likelihood Estimation in Semiparametric Regression Models Thomas A. Severini Department of Statistics Northwestern University Joint work with Heping He, University of York Introduction Let Y
More information1 Delayed Renewal Processes: Exploiting Laplace Transforms
IEOR 6711: Stochastic Models I Professor Whitt, Tuesday, October 22, 213 Renewal Theory: Proof of Blackwell s theorem 1 Delayed Renewal Processes: Exploiting Laplace Transforms The proof of Blackwell s
More informationModelling Complex Queuing Situations with Markov Processes
Modelling Complex Queuing Situations with Markov Processes Jason Randal Thorne, School of IT, Charles Sturt Uni, NSW 2795, Australia Abstract This article comments upon some new developments in the field
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationTechnical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
Technical Appendix for: When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance In this technical appendix we provide proofs for the various results stated in the manuscript
More informationA Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime
A Diffusion Approximation for Stationary Distribution of Many-Server Queueing System In Halfin-Whitt Regime Mohammadreza Aghajani joint work with Kavita Ramanan Brown University APS Conference, Istanbul,
More informationThe Institute for Integrating Statistics in Decision Sciences
The Institute for Integrating Statistics in Decision Sciences Technical Report TR-- December, Predicting Gridlocks in Emergency Departments: A Bayesian Discrete Time Queueing Theoretic Approach Toros Caglar
More informationChapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 22 12/09/2013. Skorokhod Mapping Theorem. Reflected Brownian Motion
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.7J Fall 213 Lecture 22 12/9/213 Skorokhod Mapping Theorem. Reflected Brownian Motion Content. 1. G/G/1 queueing system 2. One dimensional reflection mapping
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationFaculty of Science and Technology MASTER S THESIS
Faculty of Science and Technology MASTER S THESIS Study program/ Specialization: Spring semester, 20... Open / Restricted access Writer: Faculty supervisor: (Writer s signature) External supervisor(s):
More informationSolution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.
Solutions Stochastic Processes and Simulation II, May 18, 217 Problem 1: Poisson Processes Let {N(t), t } be a homogeneous Poisson Process on (, ) with rate λ. Let {S i, i = 1, 2, } be the points of the
More informationProceedings of the 2017 Winter Simulation Conference W. K. V. Chan, A. D Ambrogio, G. Zacharewicz, N. Mustafee, G. Wainer, and E. Page, eds.
Proceedings of the 2017 Winter Simulation Conference W. K. V. Chan, A. D Ambrogio, G. Zacharewicz, N. Mustafee, G. Wainer, and E. Page, eds. SIMULATION-BASED PREDICTIVE ANALYTICS FOR DYNAMIC QUEUEING SYSTEMS
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationPoint Process Control
Point Process Control The following note is based on Chapters I, II and VII in Brémaud s book Point Processes and Queues (1981). 1 Basic Definitions Consider some probability space (Ω, F, P). A real-valued
More informationWeighted Likelihood Ratio Chart for Statistical Monitoring of Queueing Systems
Weighted Likelihood Ratio Chart for Statistical Monitoring of Queueing Systems Dequan Qi 1, Zhonghua Li 2, Xuemin Zi 3, Zhaojun Wang 2 1 LPMC and School of Mathematical Sciences, Nankai University, Tianjin
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More information2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES
295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.
More informationUnderstanding Regressions with Observations Collected at High Frequency over Long Span
Understanding Regressions with Observations Collected at High Frequency over Long Span Yoosoon Chang Department of Economics, Indiana University Joon Y. Park Department of Economics, Indiana University
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationPROOFS FOR MANAGING PRODUCT ROLLOVERS BY
APPENDIX A: PROOFS FOR MANAGING PRODUCT ROLLOVERS BY KOCA, SOUZA AND DRUEHL Derivation of h(γ) Let R it denote the reservation price for product i at time t, a random variable. We write R t = u(ω)ε t,
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationCHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK
CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation
More informationReview of Queuing Models
Review of Queuing Models Recitation, Apr. 1st Guillaume Roels 15.763J Manufacturing System and Supply Chain Design http://michael.toren.net/slides/ipqueue/slide001.html 2005 Guillaume Roels Outline Overview,
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationProactive Care with Degrading Class Types
Proactive Care with Degrading Class Types Yue Hu (DRO, Columbia Business School) Joint work with Prof. Carri Chan (DRO, Columbia Business School) and Prof. Jing Dong (DRO, Columbia Business School) Motivation
More informationAll models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf
PART II (3) Continuous Time Markov Chains : Theory and Examples -Pure Birth Process with Constant Rates -Pure Death Process -More on Birth-and-Death Process -Statistical Equilibrium (4) Introduction to
More informationAsymptotic study of a busy period in a retrial queue
PUB. IRMA, LILLE 2011 Vol. 71, N o VI Asymptotic study of a busy period in a retrial queue Y. Taleb a, F. Achemine a, D. Hamadouche a, A. Aissani b djhamad@mail.ummto.dz, taleb.youcef@yahoo.fr, achemine_f2001@yahoo.fr,
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationTMA4265 Stochastic processes ST2101 Stochastic simulation and modelling
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 7 English Contact during examination: Øyvind Bakke Telephone: 73 9 8 26, 99 4 673 TMA426 Stochastic processes
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationREAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS
REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY IN MANY-SERVER SERVICE SYSTEMS WITH TIME-VARYING ARRIVALS by Rouba Ibrahim and Ward Whitt IEOR Department Columbia University 500 West 120th Street 313
More informationStabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
OPERATIONS RESEARCH Vol. 6, No. 6, November December 212, pp. 1551 1564 ISSN 3-364X (print) ISSN 1526-5463 (online) http://dx.doi.org/1.1287/opre.112.114 212 INFORMS Stabilizing Customer Abandonment in
More informationThe Offered-Load Process: Modeling, Inference and Applications. Research Thesis
The Offered-Load Process: Modeling, Inference and Applications Research Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Statistics Michael Reich Submitted
More informationREDUCING INPUT PARAMETER UNCERTAINTY FOR SIMULATIONS. Szu Hui Ng Stephen E. Chick
Proceedings of the 2001 Winter Simulation Conference B. A. Peters, J. S. Smith, D. J. Medeiros, and M. W. Rohrer, eds. REDUCING INPUT PARAMETER UNCERTAINTY FOR SIMULATIONS Szu Hui Ng Stephen E. Chick Department
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationConvexity Properties of Loss and Overflow Functions
Convexity Properties of Loss and Overflow Functions Krishnan Kumaran?, Michel Mandjes y, and Alexander Stolyar? email: kumaran@lucent.com, michel@cwi.nl, stolyar@lucent.com? Bell Labs/Lucent Technologies,
More informationb k b m 1 b m 2 b 1 b 0 b k
International Mathematical Forum, Vol. 6, 2011, no. 62, 3087-3092 Estimating Changes in Traffic Intensity for M/M/1/m Queueing Systems Sarat Kumar Acharya Departament of Statistics, Sambalpur University
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationec1 e-companion to Liu and Whitt: Stabilizing Performance
ec1 This page is intentionally blank. Proper e-companion title page, with INFORMS branding and exact metadata of the main paper, will be produced by the INFORMS office when the issue is being assembled.
More informationModern Statistical Process Control Charts and Their Applications in Analyzing Big Data
Modern Statistical Process Control Charts and Their Applications in Analyzing Big Data (Part III: Profile Monitoring and Dynamic Screening) Peihua Qiu pqiu@ufl.edu Department of Biostatistics University
More informationSTABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES
Probability in the Engineering and Informational Sciences, 28, 24, 49 449. doi:.7/s2699648484 STABILIZING PERFORMANCE IN NETWORKS OF QUEUES WITH TIME-VARYING ARRIVAL RATES YUNAN LIU AND WARD WHITT Department
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More information