An Introduction to Queueing Theory
|
|
- Geraldine Morgan
- 7 years ago
- Views:
Transcription
1 An Introduction to Queueing Theory Rein Nobel Department of Econometrics, Vrije Universiteit, Amsterdam Open Middag november 20
2 Overview. Basic results for queueing models in continuous time: (a) delay models [Erlang-C] (b) loss models [Erlang-B] (c) retrial models (d) abandonment models [Erlang-A] 2. Models in discrete time.
3 A short introduction to queueing theory Queueing Theory (QT) is the science of congestion. A personal experience at New Delhi Airport while waiting in line for the immigration: (To an airport official) I: Sir, we are staying in line already for more than two hours without any visible progress! Can you please tell us what is going on? Official: No problem, Sir! There is only congestion in the queue! 2
4 The basic elements of a (simple) queueing model Customers (jobs) arrive (singly or in groups) at a service facility, One or more servers occupy the facility to serve customers, A waiting space (infinite or finite [physical] buffer or [virtual] orbit) for customers who cannot be served immediately upon arrival. 3
5 We distinguish four main characteristics of queueing models: delay models: customers wait in line until they can be served loss models: customers leave the system when they find all servers busy upon arrival retrial models: customers who do not find an idle server upon arrival leave the system only temporarily, and try to reenter some random time later abandonment models: customers waiting in line will leave the system before being served after their patience time has expired. 4
6 Example: M/G/ delay model: Customers arrive according to a Poisson process with rate λ [process A], There is one server and an infinite waiting space, Each customer requires a generally distributed service time S [process B], Customers who upon arrival find the server busy wait in line, The customers are served in order of arrival (FIFO), 5
7 A = {A n ; n =, 2,...}, B = {S n ; n =, 2,...}. A n exp(λ), S n G( ). traffic intensity: ρ = λe[s] <. { customer n has to wait in line C n = 0 otherwise D n = waiting time in the queue of customer n, Q(t) = number of customers waiting at time t. D n+ = max(d n + S n A n+, 0), D = 0. 6
8 Endogenous processes: C = {C n ; n =, 2,...}, D = {D n ; n =, 2,...}, Q = {Q(t), t 0}. Some well-known results for the M/G/ queue: lim n n n k= Pollaczek-Khintchine formula D := lim n n Q := lim t t n k= C k = ρ, w.p.. D k = λe[s2 ] 2( ρ) w.p. 0 Q(u)du = λ2 E[S 2 ] 2( ρ) w.p.. 7
9 Little s Law Q = λ D. The busy period L = length of a time interval that the server is busy uninterruptedly. E[L] = E[S] ρ
10 The M/M/c model [Erlang-C] Customers arrive according to a Poisson process with rate λ, There are c servers and there is an infinite waiting space, Each customer requires an exponential service time with mean /µ, Customers who upon arrival find all servers busy wait in line, Customers are served in FIFO order. 8
11 The Erlang-C formulae The traffic-intensity is now ρ := λ/(cµ), Π delay = IP(D > 0) = (cρ)c c!( ρ) Q = (cρ)c ρ c!( ρ) 2 c k=0 IP(D > x) = Π delay e cµ( ρ)x (cρ) k k! c k=0 (cρ) k k! + (cρ)c c!( ρ) + (cρ)c c!( ρ) D = Q λ = (cρ) c c!cµ( ρ) 2 c k=0 (cρ) k k! + (cρ)c c!( ρ) 9
12 Example: Erlang s Loss Model M/G/c/c [Erlang-B] Customers arrive according to a Poisson process with rate λ, There are c servers and there is no waiting space, Each customer requires a generally distributed service time S, Customers who upon arrival find all servers busy are rejected forever, R n = { customer n finds all servers busy 0 otherwise. 0
13 Erlang s Loss Formula [Erlang-B] E,c := Π lost = lim n n n k= R k = (λe[s])c /c! ci=0 (λe[s]) i /i!
14 Example: M/G/ retrial queue: Customers arrive according to a Poisson process with rate λ, There is one server and an infinite virtual waiting space (orbit), Each customer requires a generally distributed service time S G( ), Customers who upon arrival find the server busy try to reenter after an exponential time R exp(ν), { server busy at time t C(t) = 0 otherwise D n = waiting time in the orbit of customer n, Q(t) = number of customers in orbit at time t.
15 Some results for the retrial queue lim t t t 0 C(u)du = ρ, w.p., D := lim n n Q := lim t t n k= D k = λe[s2 ] 2( ρ) + ρ ν( ρ) w.p. 0 Q(u)du = λ2 E[S 2 ] 2( ρ) + λρ ν( ρ) w.p.. 2
16 The busy period in the M/G/ retrial queue L = time lapse from the start of a service while the orbit is empty until the first service completion epoch while the orbit is empty. where E[L] = E[S] ρ + ρ exp { λ ν β(s) = u β(λ( u)) 0 ν(β(λ( u)) u) } β(λ( v)) β(λ( v)) v dv du, 0 e st dg(t). 3
17 The Palm/Erlang-A Queue Customers arrive according to a Poisson process with rate λ, There are c servers and there is an infinite waiting space, Each customer requires an exponential service time with mean /µ, Customers who upon arrival find all servers busy wait in line to be served, Customers wait in line only an exponentially distributed time with mean /θ [patience time]. 4
18 Some performance measures for the Palm/Erlang-A model Introduce the incomplete Gamma function γ(x, y) := y 0 tx e t dt, x > 0, y 0, A(x, y) := xey y x γ(x, y) = + j= y i j x > 0, y 0 and k= (x + k), E,c := (λ/µ)c /c! ci=0 (λ/µ) i /i!. Then Π delay = A ( cµ θ IP(D > 0) = ) θ E,c + ( A ( cµ θ, λ ) ) θ E,c IP(Ab D > 0) = ρa ( cµ θ, λ ) + ρ. θ 5
19 Some relations between the performance measures From Little s Law [ Q = λ D] we get IP(Ab) = θ D, due to θ Q = λip(ab), or, equivalently, IP(Ab D > 0) = θ IE[D D > 0]. So we get IE[D D > 0] = θ D = θ ρa ( cµ θ, λ θ ρa ( cµ θ, λ θ ) + and by multiplying with IP(D > 0) ρ ) + ρ A ( cµ θ, λ ) θ E,c + ( A ( cµ θ, λ ) ). θ E,c 6
Rule-based Traffic Management for Inbound Call Centers
Vrije Universiteit Amsterdam Research Paper Business Analytics Rule-based Traffic Management for Inbound Call Centers Auteur: Tim Steinkuhler Supervisor: Prof. Dr. Ger Koole October 7, 2014 Contents Preface
More informationα α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =
More informationUNIT 2 QUEUING THEORY
UNIT 2 QUEUING THEORY LESSON 24 Learning Objective: Apply formulae to find solution that will predict the behaviour of the single server model II. Apply formulae to find solution that will predict the
More informationPerformance Analysis of a Telephone System with both Patient and Impatient Customers
Performance Analysis of a Telephone System with both Patient and Impatient Customers Yiqiang Quennel Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9
More informationExponential Approximation of Multi-Skill Call Centers Architecture
Exponential Approximation of Multi-Skill Call Centers Architecture Ger Koole and Jérôme Talim Vrije Universiteit - Division of Mathematics and Computer Science De Boelelaan 1081 a - 1081 HV Amsterdam -
More informationStochastic Models for Inventory Management at Service Facilities
Stochastic Models for Inventory Management at Service Facilities O. Berman, E. Kim Presented by F. Zoghalchi University of Toronto Rotman School of Management Dec, 2012 Agenda 1 Problem description Deterministic
More informationSupplement to Call Centers with Delay Information: Models and Insights
Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290
More informationTenth Problem Assignment
EECS 40 Due on April 6, 007 PROBLEM (8 points) Dave is taking a multiple-choice exam. You may assume that the number of questions is infinite. Simultaneously, but independently, his conscious and subconscious
More information4 The M/M/1 queue. 4.1 Time-dependent behaviour
4 The M/M/1 queue In this chapter we will analyze the model with exponential interarrival times with mean 1/λ, exponential service times with mean 1/µ and a single server. Customers are served in order
More informationSimple Markovian Queueing Systems
Chapter 4 Simple Markovian Queueing Systems Poisson arrivals and exponential service make queueing models Markovian that are easy to analyze and get usable results. Historically, these are also the models
More informationThe Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback
The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback Hamada Alshaer Université Pierre et Marie Curie - Lip 6 7515 Paris, France Hamada.alshaer@lip6.fr
More informationM/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
More informationFluid Approximation of a Priority Call Center With Time-Varying Arrivals
Fluid Approximation of a Priority Call Center With Time-Varying Arrivals Ahmad D. Ridley, Ph.D. William Massey, Ph.D. Michael Fu, Ph.D. In this paper, we model a call center as a preemptive-resume priority
More information6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory
6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory Massachusetts Institute of Technology Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS
More informationINSURANCE RISK THEORY (Problems)
INSURANCE RISK THEORY (Problems) 1 Counting random variables 1. (Lack of memory property) Let X be a geometric distributed random variable with parameter p (, 1), (X Ge (p)). Show that for all n, m =,
More informationOptimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani. EPEW 2014, Florence
Optimal Hiring of Cloud Servers A. Stephen McGough, Isi Mitrani EPEW 2014, Florence Scenario How many cloud instances should be hired? Requests Host hiring servers The number of active servers is controlled
More informationMarkov chain models of a telephone call center with call blending
Markov chain models of a telephone call center with call blending Alexandre Deslauriers Juta Pichitlamken Pierre L Ecuyer Athanassios N. Avramidis GERAD and Département d Informatique et de Recherche Opérationnelle
More information1. Repetition probability theory and transforms
1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is
More informationLECTURE - 1 INTRODUCTION TO QUEUING SYSTEM
LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM Learning objective To introduce features of queuing system 9.1 Queue or Waiting lines Customers waiting to get service from server are represented by queue and
More informationSTANDARD AND RETRIAL QUEUEING SYSTEMS: A COMPARATIVE ANALYSIS. Jesús ARTALEJO and Gennadi FALIN
ISSN 1139-1138 STANDARD AND RETRIAL QUEUEING SYSTEMS: A COMPARATIVE ANALYSIS Jesús ARTALEJO and Gennadi FALIN Abstract We describe main models and results of a new branch of the queueing theory, theory
More informationStirling s formula, n-spheres and the Gamma Function
Stirling s formula, n-spheres and the Gamma Function We start by noticing that and hence x n e x dx lim a 1 ( 1 n n a n n! e ax dx lim a 1 ( 1 n n a n a 1 x n e x dx (1 Let us make a remark in passing.
More informationStatistical Analyses of Call Center Data
Statistical Analyses of Call Center Data Research Thesis In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Polyna Khudyakov Submitted to the Senate of the Technion - Israel
More informationProbability Calculator
Chapter 95 Introduction Most statisticians have a set of probability tables that they refer to in doing their statistical wor. This procedure provides you with a set of electronic statistical tables that
More informationModelling the performance of computer mirroring with difference queues
Modelling the performance of computer mirroring with difference queues Przemyslaw Pochec Faculty of Computer Science University of New Brunswick, Fredericton, Canada E3A 5A3 email pochec@unb.ca ABSTRACT
More informationISyE 2030 Test 2 Solutions
1 NAME ISyE 2030 Test 2 Solutions Fall 2004 This test is open notes, open books. Do precisely 5 of the following problems your choice. You have exactly 55 minutes. 1. Suppose that we are simulating the
More informationA Quantitative Approach to the Performance of Internet Telephony to E-business Sites
A Quantitative Approach to the Performance of Internet Telephony to E-business Sites Prathiusha Chinnusamy TransSolutions Fort Worth, TX 76155, USA Natarajan Gautam Harold and Inge Marcus Department of
More information12.5: CHI-SQUARE GOODNESS OF FIT TESTS
125: Chi-Square Goodness of Fit Tests CD12-1 125: CHI-SQUARE GOODNESS OF FIT TESTS In this section, the χ 2 distribution is used for testing the goodness of fit of a set of data to a specific probability
More informationIEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
More informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
More informationFluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units
Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units by Rasha Ibrahim Sakr, B.Sc. A thesis submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment
More informationDepartment of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.
Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x
More informationAnalysis on Data Collection with Multiple Mobile Elements in Wireless Sensor Networks
Analysis on Data Collection with Multiple Mobile Elements in Wireless Sensor Networks Liang He,2, Jianping Pan, and Jingdong Xu 2 University of Victoria, Victoria, BC, Canada 2 Nankai University, Tianjin,
More informationSimple Queuing Theory Tools You Can Use in Healthcare
Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful
More informationStochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations
56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE
More informationStatistics 100A Homework 8 Solutions
Part : Chapter 7 Statistics A Homework 8 Solutions Ryan Rosario. A player throws a fair die and simultaneously flips a fair coin. If the coin lands heads, then she wins twice, and if tails, the one-half
More informationA joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts
*Manuscript Click here to view linked References A joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts Abstract We consider a workforce
More informationNetwork Design Performance Evaluation, and Simulation #6
Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival
More informationVISUALIZATION OF DENSITY FUNCTIONS WITH GEOGEBRA
VISUALIZATION OF DENSITY FUNCTIONS WITH GEOGEBRA Csilla Csendes University of Miskolc, Hungary Department of Applied Mathematics ICAM 2010 Probability density functions A random variable X has density
More informationMATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables
MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables Tony Pourmohamad Department of Mathematics De Anza College Spring 2015 Objectives By the end of this set of slides,
More information----------------------------------------------------------------------------------------------------------------------------
Ditila Ekmekçiu: Optimizing a call center performance using queueing models an Albanian case Optimizing a call center performance using queueing models an Albanian Case Ditila Ekmekçiu University of Tirana,
More informationChapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi
Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) A goal of many waiting line problems is to help
More informationOptimal shift scheduling with a global service level constraint
Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The
More informationFor a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
More informationReal-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers
Real-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers Oualid Jouini Auke Pot Yves Dallery Ger Koole Ecole Centrale Paris Vrije Universiteit Amsterdam Laboratoire Génie Industriel
More informationResource Pooling in the Presence of Failures: Efficiency versus Risk
Resource Pooling in the Presence of Failures: Efficiency versus Risk Sigrún Andradóttir and Hayriye Ayhan H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology
More informationQUEUING THEORY. 1. Introduction
QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze
More informationANALYSIS OF A QUEUEING MODEL FOR A CALL CENTER WITH IMPATIENT CUSTOMERS AND AFTER-CALL WORK. Hideaki Takagi 1, Yutaro Taguchi 2
International Journal of Pure and Applied Mathematics Volume 9 No. 2 214, 25-237 ISSN: 1311-88 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/1.12732/ijpam.v9i2.1
More informationQ UEUING ANALYSIS. William Stallings
Q UEUING ANALYSIS William Stallings WHY QUEUING ANALYSIS?...2 QUEUING MODELS...3 The Single-Server Queue...3 Queue Parameters...4 The Multiserver Queue...5 Basic Queuing Relationships...5 Assumptions...5
More information1 The EOQ and Extensions
IEOR4000: Production Management Lecture 2 Professor Guillermo Gallego September 9, 2004 Lecture Plan 1. The EOQ and Extensions 2. Multi-Item EOQ Model 1 The EOQ and Extensions This section is devoted to
More informationExercises on ns-2. Chadi BARAKAT. INRIA, PLANETE research group 2004, route des Lucioles 06902 Sophia Antipolis, France
Exercises on ns-2 Chadi BARAKAT INRIA, PLANETE research group 2004, route des Lucioles 06902 Sophia Antipolis, France Email: Chadi.Barakat@sophia.inria.fr November 21, 2003 The code provided between the
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationEvaluation and optimization of polling systems
Internship report Evaluation and optimization of polling systems Author: Jan-Pieter Dorsman Supervisor CWI: prof. dr. R.D. van der Mei Supervisors VU: dr. ir. E.M.M. Winands A. Roubos, MSc Internship
More informationQueuing Theory II 2006 Samuel L. Baker
QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line
More informationCHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.
Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,
More informationFundamental Bounds on the Accuracy of Network Performance Measurements
Fundamental Bounds on the Accuracy of etwork Performance Measurements Matthew Roughan School of Mathematical Sciences the University of Adelaide, Adelaide 55, Australia,
More informationQueuing Processes. Queuing Processes is a subject that have been overlooked by research in
Queuing Processes Abstract. Queuing Processes is a subject that have been overlooked by research in economic applications. The objective of this paper is to give some economic insights of the queuing applications
More informationEstimating the Degree of Activity of jumps in High Frequency Financial Data. joint with Yacine Aït-Sahalia
Estimating the Degree of Activity of jumps in High Frequency Financial Data joint with Yacine Aït-Sahalia Aim and setting An underlying process X = (X t ) t 0, observed at equally spaced discrete times
More informationTRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM. M. J. Fischer D. A. Garbin A. Gharakhanian D. M.
TRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM M. J. Fischer D. A. Garbin A. Gharakhanian D. M. Masi January 1999 Mitretek Systems 7525 Colshire Drive McLean, VA
More informationTraffic Engineering Techniques in Telecommunications
Traffic Engineering Techniques in Telecommunications by: Richard Parkinson Introduction: The use of mathematical modeling to predict line, equipment, and staff capacities for telephone systems is an accepted
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More information2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
More informationCHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
More informationOptimal outpatient appointment scheduling
Optimal outpatient appointment scheduling Guido C. Kaandorp & Ger Koole Department of Epidemiology & Biostatistics, Erasmus Medical Center Rotterdam, he Netherlands Department of Mathematics, VU University
More informationRandom access protocols for channel access. Markov chains and their stability. Laurent Massoulié.
Random access protocols for channel access Markov chains and their stability laurent.massoulie@inria.fr Aloha: the first random access protocol for channel access [Abramson, Hawaii 70] Goal: allow machines
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More informationOnline Scheduling Policies for Multiclass Call Centers. with Impatient Customers
Online Scheduling Policies for Multiclass Call Centers with Impatient Customers Oualid Jouini 1 Auke Pot 2 Ger Koole 3 Yves Dallery 1 1 Laboratoire Génie Industriel, Ecole Centrale Paris, Grande Voie des
More informationENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL
ENGINEERING SOLUTION OF A BASIC CALL-CENTER MODEL by Ward Whitt Department of Industrial Engineering and Operations Research Columbia University, New York, NY 10027 Abstract An algorithm is developed to
More informationEXAM 3, FALL 003 Please note: On a one-time basis, the CAS is releasing annotated solutions to Fall 003 Examination 3 as a study aid to candidates. It is anticipated that for future sittings, only the
More informationA Method for Staffing Large Call Centers Based on Stochastic Fluid Models
A Method for Staffing Large Call Centers Based on Stochastic Fluid Models J. Michael Harrison Stanford University Assaf Zeevi Columbia University Submitted : September 2003 Revised: February 2004 Abstract
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationWhen Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance
When Promotions Meet Operations: Cross-Selling and Its Effect on Call-Center Performance Mor Armony 1 Itay Gurvich 2 Submitted July 28, 2006; Revised August 31, 2007 Abstract We study cross-selling operations
More informationMultimedia Messaging Service: System Description and Performance Analysis
Multimedia Messaging Service: System Description and Performance Analysis Majid Ghaderi and Srinivasan Keshav School of Computer Science University of Waterloo, Waterloo, ON N2L 3G1, Canada {mghaderi,keshav}@uwaterloo.ca
More informationStaffing Call-Centers With Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach
Staffing Call-Centers With Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach Itai Gurvich James Luedtke Tolga Tezcan February 13, 2010 We consider the problem of staffing call-centers
More information2. Illustration of the Nikkei 225 option data
1. Introduction 2. Illustration of the Nikkei 225 option data 2.1 A brief outline of the Nikkei 225 options market τ 2.2 Estimation of the theoretical price τ = + ε ε = = + ε + = + + + = + ε + ε + ε =
More informationU = x 1 2. 1 x 1 4. 2 x 1 4. What are the equilibrium relative prices of the three goods? traders has members who are best off?
Chapter 7 General Equilibrium Exercise 7. Suppose there are 00 traders in a market all of whom behave as price takers. Suppose there are three goods and the traders own initially the following quantities:
More informationErrata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page
Errata for ASM Exam C/4 Study Manual (Sixteenth Edition) Sorted by Page 1 Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page Practice exam 1:9, 1:22, 1:29, 9:5, and 10:8
More informationChapter 5 Discrete Probability Distribution. Learning objectives
Chapter 5 Discrete Probability Distribution Slide 1 Learning objectives 1. Understand random variables and probability distributions. 1.1. Distinguish discrete and continuous random variables. 2. Able
More information1 Sufficient statistics
1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =
More informationDynamic Load Balancing in Parallel Queueing Systems: Stability and Optimal Control
Dynamic Load Balancing in Parallel Queueing Systems: Stability and Optimal Control Douglas G. Down Department of Computing and Software McMaster University 1280 Main Street West, Hamilton, ON L8S 4L7,
More informationThe Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationHedging Options In The Incomplete Market With Stochastic Volatility. Rituparna Sen Sunday, Nov 15
Hedging Options In The Incomplete Market With Stochastic Volatility Rituparna Sen Sunday, Nov 15 1. Motivation This is a pure jump model and hence avoids the theoretical drawbacks of continuous path models.
More informationA Markovian Sensibility Analysis for Parallel Processing Scheduling on GNU/Linux
A Markovian Sensibility Analysis for Parallel Processing Scheduling on GNU/Linux Regiane Y. Kawasaki 1, Luiz Affonso Guedes 2, Diego L. Cardoso 1, Carlos R. L. Francês 1, Glaucio H. S. Carvalho 1, Solon
More informationMAINTAINED SYSTEMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University ENGINEERING RELIABILITY INTRODUCTION
MAINTAINED SYSTEMS Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University OUTLINE MAINTE MAINTE MAINTAINED UNITS Maintenance can be employed in two different manners: Preventive
More informationMATH4427 Notebook 2 Spring 2016. 2 MATH4427 Notebook 2 3. 2.1 Definitions and Examples... 3. 2.2 Performance Measures for Estimators...
MATH4427 Notebook 2 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 2 MATH4427 Notebook 2 3 2.1 Definitions and Examples...................................
More informationTraffic Control by Influencing User Behavior
Traffic Control by Influencing User Behavior We examined a means of influencing user behavior to reduce the number of repeated calls by providing information to users and controlling the traffic before
More informationUniversity of Maryland Fraternity & Sorority Life Spring 2015 Academic Report
University of Maryland Fraternity & Sorority Life Academic Report Academic and Population Statistics Population: # of Students: # of New Members: Avg. Size: Avg. GPA: % of the Undergraduate Population
More informationFinal Mathematics 5010, Section 1, Fall 2004 Instructor: D.A. Levin
Final Mathematics 51, Section 1, Fall 24 Instructor: D.A. Levin Name YOU MUST SHOW YOUR WORK TO RECEIVE CREDIT. A CORRECT ANSWER WITHOUT SHOWING YOUR REASONING WILL NOT RECEIVE CREDIT. Problem Points Possible
More informationMODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt
MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt A great proportion of essential services are moving into internet space making the
More informationPull versus Push Mechanism in Large Distributed Networks: Closed Form Results
Pull versus Push Mechanism in Large Distributed Networks: Closed Form Results Wouter Minnebo, Benny Van Houdt Dept. Mathematics and Computer Science University of Antwerp - iminds Antwerp, Belgium Wouter
More informationx o R n a π(a, x o ) A R n π(a, x o ) π(a, x o ) A R n a a x o x o x n X R n δ(x n, x o ) d(a, x n ) d(, ) δ(, ) R n x n X d(a, x n ) δ(x n, x o ) a = a A π(a, xo ) a a A = X = R π(a, x o ) = (x o + ρ)
More informationExponential Distribution
Exponential Distribution Definition: Exponential distribution with parameter λ: { λe λx x 0 f(x) = 0 x < 0 The cdf: F(x) = x Mean E(X) = 1/λ. f(x)dx = Moment generating function: φ(t) = E[e tx ] = { 1
More informationTelephone Traffic Queues in a Customer Call Center. A Thesis. Presented for the. Master of Science Degree. The University of Tennessee at Chattanooga
Telephone Traffic Queues in a Customer Call Center A Thesis Presented for the Master of Science Degree The University of Tennessee at Chattanooga Patrick Todd April 2009 Copyright 2009 by Patrick Todd
More informationAn Application of Queuing Theory to Modeling of Melange Yarns Part I: A Queuing Model of Melange Yarn Structure
Textile Research Journal Article An Application of Queuing Theory to Modeling of Melange Yarns Part I: A Queuing Model of Melange Yarn Structure Abstract A queuing model of staple fiber yarn is presented
More informationBrownian Motion and Stochastic Flow Systems. J.M Harrison
Brownian Motion and Stochastic Flow Systems 1 J.M Harrison Report written by Siva K. Gorantla I. INTRODUCTION Brownian motion is the seemingly random movement of particles suspended in a fluid or a mathematical
More informationSimulating Stochastic Differential Equations
Monte Carlo Simulation: IEOR E473 Fall 24 c 24 by Martin Haugh Simulating Stochastic Differential Equations 1 Brief Review of Stochastic Calculus and Itô s Lemma Let S t be the time t price of a particular
More informationHypothesis testing - Steps
Hypothesis testing - Steps Steps to do a two-tailed test of the hypothesis that β 1 0: 1. Set up the hypotheses: H 0 : β 1 = 0 H a : β 1 0. 2. Compute the test statistic: t = b 1 0 Std. error of b 1 =
More informationuation of a Poisson Process for Emergency Care
QUEUEING THEORY WITH APPLICATIONS AND SPECIAL CONSIDERATION TO EMERGENCY CARE JAMES KEESLING. Introduction Much that is essential in modern life would not be possible without queueing theory. All communication
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationOption Pricing. 1 Introduction. Mrinal K. Ghosh
Option Pricing Mrinal K. Ghosh 1 Introduction We first introduce the basic terminology in option pricing. Option: An option is the right, but not the obligation to buy (or sell) an asset under specified
More informationThe Analysis of Dynamical Queueing Systems (Background)
The Analysis of Dynamical Queueing Systems (Background) Technological innovations are creating new types of communication systems. During the 20 th century, we saw the evolution of electronic communication
More information