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

Similar documents
Chapter 5: Special Types of Queuing Models

λ λ λ In-class problems

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

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

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 "

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

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

Classification of Queuing Models

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

Outline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.

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

Introduction to queuing theory

Computer Systems Modelling

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

Answers to selected exercises

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

57:022 Principles of Design II Final Exam Solutions - Spring 1997

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.

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

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

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

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

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

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Review of Queuing Models

CS 1538: Introduction to Simulation Homework 1

Introduction to Queuing Networks Solutions to Problem Sheet 3

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

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

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

4.7 Finite Population Source Model

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

Queuing Theory. Using the Math. Management Science

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

Slides 9: Queuing Models

Performance Evaluation of Queuing Systems

EE 368. Weeks 3 (Notes)

PBW 654 Applied Statistics - I Urban Operations Research

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

IEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013

Queueing Theory (Part 4)

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

Basic Queueing Theory

Data analysis and stochastic modeling

Name of the Student:

Systems Simulation Chapter 6: Queuing Models

The Transition Probability Function P ij (t)

ISyE 2030 Practice Test 2

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

Probability and Statistics Concepts

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

Kendall notation. PASTA theorem Basics of M/M/1 queue

Computer Networks More general queuing systems

THE KINLEITH WEIGHBRIDGE

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

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.

STEADY-STATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: Part II

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

Computer Systems Modelling

On optimization of a Coxian queueing model with two phases

Readings: Finish Section 5.2

Non Markovian Queues (contd.)

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

CS418 Operating Systems

QUEUING MODELS AND MARKOV PROCESSES

IE 5112 Final Exam 2010

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

IE 336 Seat # Name (one point) < KEY > Closed book. Two pages of hand-written notes, front and back. No calculator. 60 minutes.

Q = (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?

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

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time

Figure 10.1: Recording when the event E occurs

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

QUEUING SYSTEM. Yetunde Folajimi, PhD

Bulk input queue M [X] /M/1 Bulk service queue M/M [Y] /1 Erlangian queue M/E k /1

IOE 202: lectures 11 and 12 outline

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

To describe a queuing system, an input process and an output process has to be specified.

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.

Introduction to queuing theory

Solution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.

One billion+ terminals in voice network alone

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:

The Behavior of a Multichannel Queueing System under Three Queue Disciplines

All models are wrong / inaccurate, but some are useful. George Box (Wikipedia). wkc/course/part2.pdf

Introduction to Queueing Theory

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

An M/M/1/N Queuing system with Encouraged Arrivals

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

O June, 2010 MMT-008 : PROBABILITY AND STATISTICS

Photo: US National Archives

Elementary queueing system

Chapter 1: Revie of Calculus and Probability

GI/M/1 and GI/M/m queuing systems

Bernoulli Counting Process with p=0.1

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

Queueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1

IEOR 6711, HMWK 5, Professor Sigman

Section 3.3: Discrete-Event Simulation Examples

ECEn 370 Introduction to Probability

Transcription:

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print) (Family) (Given) Student I.D. Instructions: 1. This is a closed-book Test. Calculators are permitted. 2. Show all significant steps. No marks will be given for the answer alone. 3. Solve the problems in the spaces provided. If you need more space, use the back of the page (indicate this fact on the original page). 4. YOU ARE ALLOWED TO USE AID SHEET. 5. USE PEN TO WRITE THE FINAL ANSWER. 6. DRAW A BOX AROUND YOUR FINAL ANSWERS. Test # 4 contains 7 questions on 8 pages. Read the instructions carefully and sign below: (Signature) QUESTION 1 2 3 4 5 6 7 Total MARKS 8 6 6 6 10 4 6 46 SCORE Page 1 of 8

1. [8] The time between arrivals of busses follows an exponential distribution, with a mean of 60 minutes. a) What is the probability that exactly four buses will arrive during the next 2 hours? b) That at least two buses will arrive during the next 2 hours? c) That no buses will arrive during the next 2 hours d) A bus has just arrived. What is the probability that it will be between 30 and 90 minutes before the next bus arrives? a. Number of buses arriving in next two hours is Poisson with mean 2. Thus from (7) P(4 buses in next two hours) = e -2 (2) 4 /4! =.09 b. P(at least 2 buses) = 1 - P(0 buses) - P(1 bus) = 1 - e -2-2e -2 =.59 c. P(0 buses) = e -2 (2) 0 /0! = e -2 =.14 d. Interarrival time has density (in hours) e -t. Thus we seek 3/2 3/2 e -t dt = [-e -t ] = e -.5 - e -1.5 =.38 1/2 1/2 Page 2 of 8

2. [ 6] My home uses two light bulbs. On average, a light bulb lasts for 22 days (exponentially distributed). When a light bulb burns out, it takes an average of 2 days (exponentially distributed) before I replace the bulb. a) Formulate a three-state birth-death model of this situation. b) Determine the fraction of the time that both light bulbs are working c) Determine the fraction of the time that no light bulbs are working. a. Let the state be the number of working bulbs. Possible states are 0, 1, and 2. Birth = a bulb is repaired while Death = bulb burns out. Then the birth-death parameters are as follows: λ 0 = 1/2 + 1/2 = 1 µ 0 = 0 λ 1 = 1/2 µ 1 = 1/22 λ 2 = 0 µ 2 = 1/22 + 1/22 = 1/11 Steady state probabilities may be found from π 0 = π 1 /22, π 1 /2 + π 1 /22 = π 0 + π 2 /11, π 2 /11 = π 1 /2, π 0 + π 1 + π 2 = 1 or π 1 = 22π 0' π 2 = 121π 0. Thus π 0 (1 + 22 + 121) = 1 or π 0 = 1/144, π 1 = 11/72, π 2 = 121/144. b. π 2 = 121/144 c. π 0 = 1/144 Page 3 of 8

3. [6] A fast-food restaurant has one drive-through window. An average of 40 customers per hour arrive at the window. It takes an average of 1 minute to serve a customer. Assume that interarrival and service times are exponential. a) On the average, how many customers are waiting in line? b) On average, how long does a customer spend at the restaurant (from time of arrival to time service is completed)? c) What fraction of the time are more than 3 cars waiting for service (this includes the car (if any) at the window)? a. L q = 40 2 /(60-40)60 = 1.33 customers b. W = 1/(60-40) = 1/20 hour = 3 minutes c. 1 - π 0 - π 1 - π 2 - π 3 = 1-1/3-2/9-4/27-8/81 = 16/81. Page 4 of 8

4. [6] An average of 40 cars per hour (interarrival times are exponentially distributed) are tempted to use the drive-in window at the Hot Dog King Restaurant. If a total of more than 4 cars are in line ( including the car at the window) a car will not enter the line. It takes an average of 4 minutes (exponentially distributed) to serve a car. a) What is the average number of cars waiting for the drive-in window (not including a car at the window)? b) On the average, how many cars will be served per hour? c) I have just joined the line at the drive-in window. On the average, how long will it be before I have received my food? We have an M/M/1/4 system with µ = 15 cars/hour and λ = 40 cars/hour. a. L q = L - L s ρ = 40/15 = 2.67 2.67 [1-5(2.67) 4 + 4(2.67) 5 ] L = ------------------ = 3.44 (1-2.67 5 ) (1-2.67) 1-2.67 π 0 = ------- =.012 L s = 1 - π 0 =.99 1-2.67 5 L q = 3.44 -.99 = 2.45 b. We seek λ(1 - π 4 ) = 40(1 -.61) = 15.6 cars/hour (π 4 = (2.67) 4 (.012) =.61) L 3.44 c. We seek W = -------- = --------- =.22 hours λ(1 - π 4 ) 40(1 -.61) Page 5 of 8

5.[10] An average of 90 patrons per hour arrive at a hotel lobby (interarrival times are exponential), waiting to check in. At present, there are 5 clerks, and patrons are waiting in a single line for the first available clerk. The average time for a clerk to service a patron is 3 minutes (exponentially distributed). Clerk earn $10 per hour, and the hotel assesses a waiting time cost of $20 for each hour that a patron waiting in line (see Table on the last page). a)[4] b)[6] Compute the expected cost per hour of the current system. The hotel is considering replacing one clerk with an Automatic Clerk Machine (ACM). Management estimates that 20% of all patrons will use an ACM. An ACM takes an average of 1 minute to service a patron. It costs $48 per day ( 1 day = 8 hours) to operate an ACM. Should the hotel install the ACM? Assume that all customers who are willing to use the ACM wait in a single queue. a. M/M/5 system with λ = 90 customers/hr and μ = 20 customers/hour. P(j 5) =.76. Then W q = P(j 5)/(100-90) =.076 hours. Expected Cost Per Hour = 10(5) + 20(90)W q = 50 + 1800(.076) = $186.80. b. With ACM we have an M/M/1 (the ACM) having λ = 18 customers per hour and μ = 60 customers per hour and an M/M/4 having λ = 72 customers/hour and μ = 20 customers/hour. For ACM W q =18/(60(60-18)) =.0071 hours and Expected ACM Cost Per Hour = 6 + 20(18)W q = $8.57. For M/M/4 system P(j 4) =.79 so W q =.79/8 =.0988 and Expected Cost Per Hour = 10(4) + 20(72)(.0988) = $182.27 Thus with ACM total hourly expected cost is 182.27 + 8.57 = 190.83. Thus do not use ACM. Page 6 of 8

6. a) [2] Each week, the Columbus Record Club attracts 100 new members. Members remain members for an average of one year ( 1 year = 52 weeks). On the average, how many members will the record club have? b) [2] The State U doctoral program in business admits an average of 25 doctoral students each year. If a doctoral student spends an average of 4 years in residence at State U, how many doctoral students would one expect to find there? a) λ = 100 members/week W = 52 weeks. Then L = λw = 5200 members. b) L = average number of doctoral students on campus 1/µ = W = 4 years so L = 25(4) = 100 students. Page 7 of 8

7.[6] Consider an M / G /1/ GD / / queuing system in which an average of 10 arrivals occur each hour. Suppose that each customer s service time follows an Erlang distribution, with rate parameter 1 customer per minute and shape parameter 4. a) Find the expected number of customers waiting in line. b) Find the expected time that a customer will spend in the system. c) what fraction of the time will the server be idle? From (9) 1/µ = Mean Service Time = 4/60 hours and Variance of Service Time = 4/60 2 = 1/900 hours 2. Then λ = 10 customers/hr. and ρ = 10(4/60) = 2/3 (10) 2 (1/900) + (2/3) 2 a. L q = ------------------------- = 5/6 customers. 2(1-2/3) b. W q = L q /λ = (5/6)/10 = 1/12 hour, and W = W q = (1/µ) = 1/12 + 1/15 =.15 hours. c. π 0 = 1-ρ = 1/3 of the time that the server is idle. THE END Total marks are 54 Page 8 of 8