Quiz Queue II. III. ( ) ( ) =1.3333

Similar documents
Classification of Queuing Models

Queuing Theory. Using the Math. Management Science

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

λ λ λ In-class problems

Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if

Chapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.

λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These

PBW 654 Applied Statistics - I Urban Operations Research

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Performance Evaluation of Queuing Systems

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

ISyE 2030 Practice Test 2

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

Introduction to queuing theory

QUEUING MODELS AND MARKOV PROCESSES

Non Markovian Queues (contd.)

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

Queuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.

Queueing Theory (Part 4)

Readings: Finish Section 5.2

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

IOE 202: lectures 11 and 12 outline

T. Liggett Mathematics 171 Final Exam June 8, 2011

Generation of Discrete Random variables

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 "

MSA 640 Homework #2 Due September 17, points total / 20 points per question Show all work leading to your answers

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Probability and Statistics Concepts

4.7 Finite Population Source Model

Slides 9: Queuing Models

Systems Simulation Chapter 6: Queuing Models

Chapter 3: Markov Processes First hitting times

Answers to selected exercises

Waiting Line Models: Queuing Theory Basics. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1

One billion+ terminals in voice network alone

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems

P (L d k = n). P (L(t) = n),

Introduction to Queueing Theory with Applications to Air Transportation Systems

10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL.

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Chapter 5: Special Types of Queuing Models

Introduction to Queueing Theory

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

Logistical and Transportation Planning Methods 1.203J/6.281J/13.665J/15.073J/16.76J/ESD.216J

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

Little s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that

Session-Based Queueing Systems

IE 5112 Final Exam 2010

Chapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.

Contents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

Queues and Queueing Networks

An Analysis of the Preemptive Repeat Queueing Discipline

Basic Queueing Theory

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Continuous-Time Markov Chain

EE 368. Weeks 3 (Notes)

QUEUING SYSTEM. Yetunde Folajimi, PhD

Computer Networks More general queuing systems

Name of the Student: Problems on Discrete & Continuous R.Vs

Massachusetts Institute of Technology

Time Reversibility and Burke s Theorem

Advanced Computer Networks Lecture 3. Models of Queuing

Introduction to Queueing Theory

Homework 1 - SOLUTION

56:171 Operations Research Final Examination December 15, 1998

Discrete Event and Process Oriented Simulation (2)

Writing and Solving Equations

MAT SYS 5120 (Winter 2012) Assignment 5 (not to be submitted) There are 4 questions.

PhysicsAndMathsTutor.com

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

STAT FINAL EXAM

Queueing Theory and Simulation. Introduction

SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012

Homework 4 Math 11, UCSD, Winter 2018 Due on Tuesday, 13th February

Link Models for Circuit Switching

Analysis of A Single Queue

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

Statistics 150: Spring 2007

IEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22.

Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design

CS 798: Homework Assignment 3 (Queueing Theory)

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

Dynamic Control of Parallel-Server Systems

Introduction to Markov Chains, Queuing Theory, and Network Performance

Name of the Student: Problems on Discrete & Continuous R.Vs

I, A BRIEF REVIEW ON INFINITE QUEUE MODEL M.

CS418 Operating Systems

Chapter 6 Continuous Probability Distributions

Queuing Theory. Queuing Theory. Fatih Cavdur April 27, 2015

Logistical and Transportation Planning. QUIZ 1 Solutions

56:171 Operations Research Fall 1998

Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Solutions to COMP9334 Week 8 Sample Problems

λ 2 1 = 2 = 2 2 2P 1 =4P 2 P 0 + P 1 + P 2 =1 P 0 =, P 1 =, P 2 = ρ 1 = P 1 + P 2 =, ρ 2 = P 1 + P 2 =

Transcription:

Quiz Queue UMJ, a mail-order company, receives calls to place orders at an average of 7.5 minutes intervals. UMJ hires one operator and can handle each call in about every 5 minutes on average. The inter-arrival times and service times follow exponential distribution. 1. What are the average arrival and service rates of calls at UMJ? a. The average arrival rate λ is 8 per hour and the average service rate μ is 12 per hour. b. The average arrival rate λ is 7.5 per hour and the average service rate μ is 5 per hour. c. The average arrival rate λ is 12 per hour and the average service rate μ is 8 per hour. d. The average arrival rate λ is 5 per hour and the average service rate μ is 7.5 per hour. 2. What is the probability of more than 1 call; and less than 5 calls arriving at UMJ in a 30-minute period? a. The average arrival rate λ is 4 per 30 minutes, and P(2 X 4)=POISSON(4,4,TRUE)- POISSON(2,4,TRUE)= 0.3907 b. The average arrival rate λ is 4 per 30 minutes, and P(1<X<5)=POISSON(4,4,TRUE)- POISSON(1,4,TRUE)= 0.5373 c. The average arrival rate λ is 8 per 30 minutes, and P(1<X<5)=POISSON(4,8,TRUE)- POISSON(1,8,TRUE)= 0.0966 d. The average arrival rate λ is 8 per 30 minutes, and P(2 X 4)=POISSON(4,8,TRUE)- POISSON(2,8,TRUE)= 0.085 Suppose UMJ receives calls to place orders at an average rate of 10 per hour and Sarah, the only operator at UMJ, can handle 15 calls per hour on the average. Both the number of calls arrived and the number of calls answered follow Poisson distribution. 3. What are the chances for Sarah take between 3 and 6 minutes to answer a call or P(3mins. X 6 mins.)? a. = =EXPONDIST(6,15,TRUE)-EXPONDIST(3,15,TRUE)=0.0000 b. = () () =EXPONDIST(6,10,TRUE)-EXPONDIST(3,10,TRUE)=0.0000 c. = =EXPONDIST(6/60,15,TRUE)-EXPONDIST(3/60,15,TRUE)=0.2492 d. = = EXPONDIST(6/60,15,TRUE)-EXPONDIST(3/60,15,TRUE)=0.2492 4. What is the utilization or the percentage of the time that Sarah is busy answering calls? a. = λ/μ = 66.67% b. = μ/λ = 125% c. = P 0 = λ/μ = 66.67% d. =1 =1 μ =33.33% 5. Which one of the followings is correct for answering the question What is the average amount of time a customer spent holding on line for Sarah to answer? I. = = =0.1333 =8 () II. III. = () =1.3333 = =0.2 =12 1

IV. = =. =8 a. I and II only b. II and III only c. I and IV only d. IV only 6. Which one of the followings is correct for answering the question What is the average number of calls waiting for Sarah to answer? I. = =0.1333 () II. = =1.3333 III. = + µ =0.2 IV. = =1.3333 () a. II and IV only b. IV only c. I and II only d. II and III only 7. Which one of the followings is correct for answering the question How long, on average, does it take for a call to get answered by Sarah? I. = = =0.1333 =8 () II. III. a. II and IV only b. III only c. I and II only d. II and III only = + =8 +4 =12 µ IV. = + µ =2 =0.2 =12 8. Which one of the followings is correct for answering the question What is the average number of calls in the system? I. = II. = =1.3333 III. = + µ IV. ==2 a. I, II and III only b. II, III and IV only c. I, III and IV only d. III and IV only 2

9. Which one of the followings is correct for answering the question What is the probability that an incoming call will have to hold on line to get answered by Sarah? I. = λ/μ = 66.67% II. = P(n 1) III. = P 0 = 66.67% IV. =1 a. I and III only b. I, II, and IV only c. I, III and IV only d. I, II and III only 10. Which one of the followings is correct for answering the question What is the probability there are more than three calls waiting for Sarah to answer? I. = P(n > 3) = 1 P(n 3) = 1 {P 0 + P 1 + P 2 + P 3 ) II. = P(n 4) = 1 P(n 4) = 1 {P 0 + P 1 + P 2 + P 3 + P 4 ) III. = P(n 5) = 1 P(n 4) = 1 {P 0 + P 1 + P 2 + P 3 + P 4 ) IV. = P 4 = P 0 (λ/μ) 4 a. I and IV only b. II and IV only c. III only d. II only Suppose UMJ receives calls to place orders at an average rate of 10 per hour and Sarah, the only operator at UMJ, can handle 15 calls per hour on the average. Both the number of calls arrived and the number of calls answered follow Poisson distribution. Sarah was paid $15 per hour in wages and benefits. The company estimates that it costs $0.50 per minute in lost sales on average for a customer to hold on line when Sarah is busy answering other calls. 11. What is the hourly average cost for UMJ to operate M/M/1 call center as given above? a. Total hourly cost = $15 + $0.50 x 60 = $45.00 per hour b. Total hourly cost = $15 + $0.50 x 60 x (L = 2) = $75.00 per hour c. Total hourly cost = $0.50 x 60 x (L = 2) = $60.00 per hour d. Total hourly cost = $15.00 per hour (You may use Q.xls to get the answers first for some of the variables for the following questions, but be sure to provide adequate explanations. Q.xls output is given in the following table for reference). Arrival rate 14 14 14 14 Service rate 15 15 15 15 Number of servers 1 2 3 4 Utilization 93.33% 46.67% 31.11% 23.33% 3

P(0), probability that the system is empty 0.0667 0.3636 0.3898 0.3928 Lq, expected queue length 13.0667 0.2598 0.0346 0.0049 L, expected number in system 14.0000 1.1932 0.9680 0.9383 Wq, expected time in queue 0.9333 0.0186 0.0025 0.0004 W, expected total time in system 1.0000 0.0852 0.0691 0.0670 Probability that a customer waits 0.9333 0.2970 0.0767 0.0162 12. Suppose that business increases by 40% in Friday afternoon, i.e., the average call arrival rate λ is 14 per hour and Sarah answers 15 calls per hour on the average. What is the average number of calls in the system? a. The average number of calls = 13.0667 b. The average number of calls = 60 c. The average number of calls = 56 d. The average number of calls = 14 13. What is the total hourly operating cost for UMJ if only Sarah answers calls with the increased incoming call volume? a. Total hourly cost = $15 = $15.00 per hour b. Total hourly cost = $15 + $0.50 x 60 x (L = 2) = $75.00 per hour c. Total hourly cost = $15 + $0.50 x 60 x (L = 14) = $435.00 per hour d. Total hourly cost = $0.50 x 60 x (L = 14) = $415.00 per hour 14. With the increased incoming call volume, what is the total hourly operating cost for UMJ if Eric is hired as the second operator with the same pay of $15 per hour and Eric answers 15 calls per hour as Sarah does? a. Total hourly cost = $15 x 2 = $30.00 per hour b. Total hourly cost = $15 x 2 + $0.50 x 60 x (L = 1.1932) = $65.80 per hour c. Total hourly cost = $15 x 2 + $0.50 x 60 x (L = 14) = $450.00 per hour d. Total hourly cost = $0.50 x 60 x (L = 1.1932) = $35.80 per hour 15. What is a call s average holding time if there is a separate phone line for each operator and we assume that approximately half of the calls join each line to hold? Assume λ = 7 incoming calls per hour for each line, and µ = 15 calls per hour for each operator. a. = 3.5 minutes b. = 7.5 minutes c. = 0.876 minutes d. = 0.4667 minutes 16. What is the total cost per hour if there is a separate phone line for each operator and we assume that approximately half of the calls join each line? Assume λ = 7 incoming calls per hour for each line, and µ = 15 calls per hour for each operator, $15 per hour is paid for each operator and $0.50 per minute for each minute a customer spent to make the call. a. = 2 x $15 = $30.00 per hour b. = 2 x {$15 + $0.50 x 60 x 0.875} = $82.50 per hour c. = 2 x {$15 + $0.50 x 60 x 1.1932} = $101.59 per hour d. = 2 x $0.50 x 60 x 0.875 = $52.50 per hour 4

17. Would you recommend UMJ to hire third operator for the situation? Why and Why not? Assume calls are through one single line to feed all of the three operators. a. No, Total hourly cost = $15 x 3 + $0.50 x 60 x (L = 0.968) = $74.04 b. No, Total hourly cost = $15 x 3 + $0.50 x 60 x (L = 1.1932) = $80.80 per hour c. Yes, Total hourly cost = $15 x 3 = $45.00 d. Yes, Total hourly cost = $0.50 x 60 x (L = 0.9680) = $29.04 per hour 18. What is the probability that no any calls in the system for UMJ with three operators to answer calls? Assume λ = 14 calls per hours and μ = 15 calls per hour for each operator and s = 3. a. 0.0667 b. 0.3636 c. 0.3898 d. 0.0162 (2.) Suppose that UMJ have both Sarah and Eric to answer calls, with average arrival rate of λ = 14 calls per hour and the average service rate of µ = 15 calls per hour per person (s=2). 19. On average, what percentage of the time are Sarah and Eric busy answering calls? a. 0.2970 b. 0.4667 c. 0.3636 d. 0.9333 20. What is the value of the probability that no any calls in the system (s=2)? You should be able to derive the answer from the general equation of M/M/s queue. a. 0.0667 b. 0.3636 c. 0.4667 d. 0.2970 21. What is the chance that there is at least one call in the system? a. 0.9333 b. 0.6102 c. 0.6072 d. 0.6364 22. What is the average number of calls waiting to be answered? a. 13.0667 b. 0.2598 c. 14.000 d. 1.1932 23. What is the average number of calls in the system? a. 13.0667 b. 0.2598 c. 14.0000 d. 1.1932 24. What is the average amount of time spent holding on line by customers of UMJ before being answered? a. 56.0000 minutes b. 60.0000 minutes c. 1.1136 minutes d. 5.1136 minutes 5

25. How long, on average, does it take a call to be answered at UMJ? a. 56.0000 minutes b. 60.0000 minutes c. 1.1136 minutes d. 5.1136 minutes 26. What is the probability that a call will have to be held on line to be answered at UMJ? a. 0.2970 b. 0.9333 c. 0.0767 d. 0.0162 27. Once a call is started to be answered, how long on the average it takes for a call to be answered? a. 1 minute b. 2 minutes c. 3 minutes d. 4 minutes 28. What is the probability there are two calls at UMJ? a. = ( µ)! b. = c. =P 0 +P 1 +P 2 d. =1 P 2 29. What is the probability there are more than two customers waiting to be served? a. =P(n 3 ) = 1 P(n 2) = 1 {P 0 + P 1 + P 2 } b. =P(n 4 ) = 1 P(n 3) = 1 {P 0 + P 1 + P 2 + P 3 } c. =P(n 5 ) = 1 P(n 4) = 1 {P 0 + P 1 + P 2 + P 3 + P 4 } d. = P 4 = ( µ )! 6