Waiting line Models.

Slides:



Advertisements
Similar presentations
Components of the Queuing System
Advertisements

Waiting Line Management
Capacity Planning and Queuing Models
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India Page 1.
Review of Probability Distributions
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
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.
D Waiting-Line Models PowerPoint presentation to accompany
Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.
Waiting Lines and Queuing Theory Models
Queueing Theory (2). Home Work 12-9 and Due Day: October 31 (Monday) 2005.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
Queueing Theory: Part I
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Waiting Line Management
Waiting Lines Students should be able to:
Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
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),
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Waiting Line Analysis for Service Improvement
Chapter 9: Queuing Models
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.
MNG221 - Management Science –
Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.

Queuing Theory (Waiting Line Models)
Queuing Models and Capacity Planning
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Introduction to Management Science
Service Systems & Queuing Chapter 12S OPS 370. Nature of Services –A
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related
1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.
Ch 6 Tech Notes OBJECTIVES
18 Management of Waiting Lines.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line Management.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Chapter 16 Capacity Planning and Queuing Models
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Waiting Lines and Queuing Theory Models
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.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Waiting Line Models Production and Operations Management Reporter:
Waiting Line Theory Akhid Yulianto, SE, MSc (log).
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.
Waiting Line Theroy BY, PRAYASH NEUPANE, KARAN CHAND & SANTOSH SHERESTHA.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
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,
Topic V. Multiple-Channel Queuing Model
Module D Waiting Line Models.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
WAITING LINES AND SIMULATION
Chapter 9: Queuing Models
Queuing Models and Capacity Planning
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Presentation transcript:

Waiting line Models

Some Examples Situation Arriving customers Service facility Sale of Theatre tickets Theatre goers Ticket booking windows Banking Transactions Bank patrons Bank Tellers Arrival of trucks to carry materials Trucks Loading crews and facilities Sale of Railway tickets Passengers Ticket counters Transfer of e-messages E-messages Transmission line Flow of ships to seashore Ships Docking facility Billing in supermarket Shoppers Checkout counters

Goal of Waiting line models Why there is a waiting line? What are the cost associated with waiting? The goal is to provide an economic balance between cost of providing service and the cost of customers waiting

Structure of Queuing system Population may be finite or may be infinite Arrivals follow Poisson’s distribution Services follow Exponential distribution

Poisson’s Distribution for Arrival process According to source: Finite or Infinite According to number: single or group Poisson’s Distribution for

Understanding use of Poisson’s distribution Example: On an average 5 customers reach a Saloon every hour. Determine the probability that less than 2 customers will reach in 30 minutes period, assuming that the arrival follow Poisson’s distribution. What will be the probability that exactly 5 customers will reach in an hour? Poisson’s function:

Different Structures of Service system

Service follows exponential distribution with pdf: Speed of Service: In an waiting line system, the speed with which service is provided can be expressed as either a) Service rate : (10 customers / hour) b) Service time: ( 6minutes / customer) Service follows exponential distribution with pdf: where is the mean number of occurrences of an event per time unit Queue Structure: a) FCFS b) LCFS

Understanding use of Exponential distribution

Example on Exponential distribution: The manager of a bank observes that 18 customers are served by a cashier in an hour. Assuming the service time has an exponential distribution, what is the probability that A customer shall be free within 3 minutes A customer shall be serviced in more than 12 minutes?

Operating Characteristics = Arrival rate µ = Service rate Lq = the average number waiting for service L = the average number in the system (i.e., waiting for service or being served) P0 = the probability of zero units in the system p = = the system utilization (percentage of time servers are busy serving customers) Wq = the average time customers must wait for service W = the average time customers spend in the system (i.e., waiting for service and service time)

A single-server model is appropriate when these conditions exist: Model 1: M/M/1/∞/ ∞ A single-server model is appropriate when these conditions exist: A Poisson arrival rate. A negative exponential service time. One server or channel First-come, first-served processing order. An infinite population. No limit on queue length i.e. infinite queue length

Relationship between average number and average time

Formulas for basic model

Formulas for basic model

Values for Lq and P0 given λ ⁄ μ and s

Example: Arrivals at a patient at a registration counter are considered to follow Poisson’s distribution, with an average time of 3 minutes between one arrival and the next. The time taken by the staff at registration desk is assumed to be distributed exponentially with a mean of 2 minutes. Find Number of patients on average waiting in the queue Average waiting time of a patient in the queue or in completing registration Average idle time for the staff in a day ( 8 hours shift)

Class exercise: A T.V repairman finds that the time spent on his jobs has an exponential distribution with mean 30 minutes. If he repairs sets in the order in which they came in and if the arrival of sets follow Poisson with an average rate of 10 per 8-hour day, what is his idle time each day? how many jobs are ahead of the set just brought in? In a railway yard, goods train arrive at the rate of 30 per day. Assuming that the arrival follow Poisson and the service time follow exponential with an average of 36 minutes, find a) the queue length b) Probability that the queue size exceeds 10 c) If the arrival rate increases to 33 per day, what will be the expected queue length?

Model 2: M/M/s/∞/ ∞ A multiple-server model is appropriate when these conditions exist: A Poisson arrival rate. A negative exponential service time. multiple servers or channels (denoted by s) First-come, first-served processing order. An infinite population. No limit on queue length i.e. infinite queue length The same mean service rate for all servers

Formulas for multiple server model Combined service rate s

Infinite Source Values for Lq and P0 given λ ⁄ μ and s

Class exercise: The Taj service station has five mechanics each of whom can service a scooter in one hour on an average. The scooters are registered at a single counter and then sent for servicing to different mechanics. Scooters arrive at the service station at an average rate of two scooter per hour. Assuming arrival follow Poisson and service time exponential, find System Utilisation The probability that the system is idle The probability that there shall be three scooters in the service center Expected number of scooters waiting in the queue