INDR 343 Problem Session 3 06.11.2014 http://home.ku.edu.tr/~indr343/

Slides:



Advertisements
Similar presentations
Components of the Queuing System
Advertisements

Waiting Line Management
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Continuous-Time Markov Chains Nur Aini Masruroh. LOGO Introduction  A continuous-time Markov chain is a stochastic process having the Markovian property.
Review of Probability Distributions
TCOM 501: Networking Theory & Fundamentals
1 Part III Markov Chains & Queueing Systems 10.Discrete-Time Markov Chains 11.Stationary Distributions & Limiting Probabilities 12.State Classification.
Continuous Time Markov Chains and Basic Queueing Theory
INDR 343 Problem Session
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Waiting Lines Example-1
Lecture 13 – Continuous-Time Markov Chains
1 Waiting Lines Also Known as Queuing Theory. 2 Have you ever been to the grocery store and had to wait in line? Or maybe you had to wait at the bank.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
HW # Due Day: Nov 23.
Queueing Theory (2). Home Work 12-9 and Due Day: October 31 (Monday) 2005.
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
EMGT 501 Fall 2005 Midterm Exam SOLUTIONS.
Chapter 13 Queuing Theory
Single queue modeling. Basic definitions for performance predictions The performance of a system that gives services could be seen from two different.
Queueing Theory: Part I
Question 11 – 3.
Queueing Theory Chapter 17.
Lecture 11 Queueing Models. 2 Queueing System  Queueing System:  A system in which items (or customers) arrive at a station, wait in a line (or queue),
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
HW # Due Day: Nov 23.
Model Antrian By : Render, ect. M/M/1 Example 2 Five copy machines break down at UM St. Louis per eight hour day on average. The average service time.
Lecture 14 – Queuing Systems
WAITING LINES The study of waiting lines, called queuing theory, is one of the most widely used and oldest management science techniques. The three basic.
Solutions Queueing Theory 1
Queuing Models and Capacity Planning
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
Introduction to Stochastic Models GSLM 54100
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
INDR 343 Problem Session
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
Chapter 2 Machine Interference Model Long Run Analysis Deterministic Model Markov Model.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Stochastic Models Lecture 2 Poisson Processes
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Chapter 16 Capacity Planning and Queuing Models
Components of the Queuing System
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
S TOCHASTIC M ODELS L ECTURE 3 P ART II C ONTINUOUS -T IME M ARKOV P ROCESSES Nan Chen MSc Program in Financial Engineering The Chinese University of Hong.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,
Managerial Decision Making Chapter 13 Queuing Models.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
ECE 358 Examples #1 Xuemin (Sherman) Shen Office: EIT 4155
Solutions Queueing Theory 1
Solutions Markov Chains 1
Solutions Queueing Theory 1
Solutions Markov Chains 1
Lecture 13 – Queuing Systems
Solutions Queueing Theory 1
Presentation transcript:

INDR 343 Problem Session 3 06.11.2014 http://home.ku.edu.tr/~indr343/

Reliability Example A shop has 2 identical machines that are operated continuously except when they are broken down. There is a full-time maintenance person who repairs a broken machine. The time to repair a machine is exponentially distributed with a mean of 0.5 day. The amount of time a repaired machine works until next failure is also exponentially distributed with a mean of 1 day. Let Xt denote the number of machines that are not functioning at time t, then X is a Markov process with the following transition rate matrix and diagram

16.8-2 Reconsider the example presented at the end of Sec. 16.8. Suppose now that a third machine, identical to the first two, has been added to the shop. The one maintenance person still must maintain all the machines. (a) Develop the rate diagram for this Markov chain. (b) Construct the steady-state equations. (c) Solve these equations for the steady-state probabilities.

16.8-3 The state of a particular continuous time Markov chain is defined as the number of jobs currently at a certain work center, where a maximum of 2 jobs are allowed. Jobs arrive individually. Whenever fewer than 2 jobs are present, the time until the next arrival has an exponential distribution with a mean of 2 days. Jobs are processed at the work center one at a time and then leave immediately. Processing times have an exponential distribution with a mean of 1 day. (a) Construct the rate diagram for this Markov chain. (b) Write the steady-state equations. (c) Solve these equations for the steady-state probabilities.

17.2-3 Mom-and-Pop’s Grocery Store has a small adjacent parking lot with three parking spaces reserved for the store’s customers. During store hours, cars enter the lot and use one of the spaces at a mean rate of 2 per hour. For n = 0, 1, 2, 3, the probability Pn that exactly n spaces currently are being used is P0 = 0.2, P1 = 0.2, P2 = 0.4, P3 = 0.3.

17.2-3 (a) Describe how this parking lot can be interpreted as being a queueing system. In particular, identify the customers and the servers. What is the service being provided? What constitutes a service time? What is the queue capacity? (b) Determine the basic measures of performance—L, Lq, W, and Wq—for this queueing system. (c) Use the results from part (b) to determine the average length of time that a car remains in a parking space.

17.4-5 A queueing system has three servers with expected service times of 30 minutes, 20 minutes, and 15 minutes. The service times have an exponential distribution. Each server has been busy with a current customer for 10 minutes. Determine the expected remaining time until the next service completion.

Poisson Distribution

Poisson Example Male & female customers arrive at a shop according to two independent Poisson processes with rates 𝜆𝑚=10/hr & 𝜆𝑓=20/hr, respectively. Each female customer spends $25 & each male customer spends $10. (a) Probability that the first customer to arrive is female? (b) Probability that no customer arrives in 1 minute? (c) Probability that 40 customers arrive in 1.5 hours (d) Expected 3-hour revenue? (e) Probability that the second customer arrives in 5 minutes?

17.4-1 Suppose that a queueing system has two servers, an exponential interarrival time distribution with a mean of 2 hours, and an exponential service-time distribution with a mean of 2 hours for each server. Furthermore, a customer has just arrived at 12:00 noon. (a) What is the probability that the next arrival will come (i) before 1:00 P.M., (ii) between 1:00 and 2:00 P.M., and (iii) after 2:00 P.M.? (b) Suppose that no additional customers arrive before 1:00 P.M. Now what is the probability that the next arrival will come between 1:00 and 2:00 P.M.? (c) What is the probability that the number of arrivals between 1:00 and 2:00 P.M. will be (i) 0, (ii) 1, and (iii) 2 or more? (d) Suppose that both servers are serving customers at 1:00 P.M. What is the probability that neither customer will have service completed (i) before 2:00 P.M., (ii) before 1:10 P.M., and (iii) before 1:01 P.M.?

17.4-7 Consider a two-server queueing system (FCFS) where all service times are independent and identically distributed according to an exponential distribution with a mean of 10 minutes. When a particular customer arrives, he finds that both servers are busy and no one is waiting in the queue. (a) What is the probability distribution (including its mean and standard deviation) of this customer’s waiting time in the queue?

17.4-7 (b) Determine the expected value and standard deviation of this customer’s waiting time in the system. (c) Suppose that this customer still is waiting in the queue 5 minutes after its arrival. Given this information, how does this change the expected value and the standard deviation of this customer’s total waiting time in the system from the answers obtained in part (b)?

17.5-1 Consider the birth-and-death process with all μn = 2 (n = 1, 2, . . .), λ0=3, λ1=2, λ2=1, and λn =0 for n=3, 4, . . . . (a) Display the rate diagram. (b) Calculate P0, P1, P2, P3, and Pn for n= 4, 5, . . . . (c) Calculate L, Lq, W, and Wq.

17.5-5 A service station has one gasoline pump. Cars wanting gasoline arrive according to a Poisson process at a mean rate of 15 per hour. However, if the pump already is being used, these potential customers may balk (drive on to another service station). In particular, if there are n cars already at the service station, the probability that an arriving potential customer will balk is n/3 for n = 1, 2, 3. The time required to service a car has an exponential distribution with a mean of 4 minutes. (a) Construct the rate diagram for this queueing system. (b) Develop the balance equations. (c) Solve these equations to find the steady-state probability distribution of the number of cars at the station. Verify that this solution is the same as that given by the general solution for the birth-and-death process. (d) Find the expected waiting time (including service) for those cars that stay.

17.5-13 Consider a queueing system that has two classes of customers, two clerks providing service, and no queue. Potential customers from each class arrive according to a Poisson process, with a mean arrival rate of 10 customers per hour for class 1 and 5 customers per hour for class 2, but these arrivals are lost to the system if they cannot immediately enter service. Each customer of class 1 that enters the system will receive service from either one of the clerks that is free, where the service times have an exponential distribution with a mean of 5 minutes. Each customer of class 2 that enters the system requires the simultaneous use of both clerks (the two clerks work together as a single server), where the service times have an exponential distribution with a mean of 5 minutes. Thus, an arriving customer of this kind would be lost to the system unless both clerks are free to begin service immediately.

17.5-13 (a) Formulate the queueing model as a continuous time Markov chain by defining the states and constructing the rate diagram. (b) Now describe how the formulation in part (a) can be fitted into the format of the birth-and-death process. (c) Use the results for the birth-and-death process to calculate the steady-state joint distribution of the number of customers of each class in the system. (d) For each of the two classes of customers, what is the expected fraction of arrivals who are unable to enter the system?