Topic V. Multiple-Channel Queuing Model

Slides:



Advertisements
Similar presentations
Components of the Queuing System
Advertisements

Waiting Line Management
Waiting Lines and Queuing Theory Models
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
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Queuing Systems Chapter 17.
Waiting Line Models And Service Improvement
D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render Principles of.
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 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),
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.
Waiting line Models.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
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 4 Mathematical and Statistical Models in Simulation.
Chapter 9: Queuing Models
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.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.

Queuing Theory (Waiting Line Models)
___________________________________________________________________________ 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.
Operations Management
Introduction to Management Science
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
Waiting Line Models (1) Pertemuan 11 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
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
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
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.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Spreadsheet Models for Managers: Session 12 12/1 Copyright © Richard Brenner Spreadsheet Models for Managers Session 12 Service Systems Single-Server.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
SIMULATION EXAMPLES QUEUEING SYSTEMS.
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.
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.
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:
(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.
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.
Queuing Models.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
Topic VI. Multiple-Channel Queuing Model (Limited queue length system)
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.
Module D Waiting Line Models.
© 2006 Prentice Hall, Inc.D – 1 Operations Management Module D – Waiting-Line Models © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
WAITING LINES AND SIMULATION
Getting Started .Cont The Basic Process Panel
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Chapter 9: Queuing Models
SIMULATION EXAMPLES QUEUEING SYSTEMS.
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Topic IV. Single Channel Systems (Limited queue length system)
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.
Queuing Models J. Mercy Arokia Rani Assistant Professor
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Presentation transcript:

Topic V. Multiple-Channel Queuing Model Olga Marukhina, Associate Professor, Control System Optimization Department, Tomsk Polytechnic University Marukhina@tpu.ru

Multichannel, single-phase waiting lines are found in many banks today: A common line is formed, and the customer at the head of the line proceeds to the first free teller. Multiserver systems have parallel service providers offering the same service. Multiserver examples include grocery stores (multiple cashiers), drive-through banks (multiple drive-through windows), and gas stations (multiple gas pumps).

Most common multi channel system contains parallel stations serving a single queue on FIFO basis All service stations provide the same service The single queue may separate into shorter queues in front of respective service stations Also when advantageous, calling units can shift from one queue to another All servers are assumed to perform at the same rate.

Example 1 Tom Jones, the mechanic at Golden Muffler Shop, is able to install new mufflers at an average rate of 3 per hour (or about 1 every 20 minutes), according to an exponential distribution. Customers seeking this service arrive at the shop on the average of 2 per hour, following a Poisson distribution. They are served on a first-in, first-out basis and come from a very large (almost infinite) population of possible buyers. From this description, we are able to obtain the operating characteristics of Golden Muffler’s queuing system:

Each mechanic installs mufflers at the rate of about µ = 3 per hour. The Golden Muffler Shop has decided to open a second garage and hire a second mechanic to handle installations. Customers, who arrive at the rate of about λ = 2 per hour, will wait in a single line until 1st of the 2d mechanics is free. Each mechanic installs mufflers at the rate of about µ = 3 per hour. We need to compare both systems. VS ?

Utilization factor of the system probability of zero cars in the system average number of cars in the queue (waiting) average number of cars in the system 0.375 hours (22.5 minutes) average time a car spends in the system 0.042 hours (2.5 minutes) average time a car spends in the queue (waiting) Average number of services

We can summarize the characteristics of the 2- channel model and compare them to those of the single-channel model as follows: The increased service has a dramatic effect on almost all characteristics. For instance, note that the time spent waiting in line drops from 40 minutes to only 2.5 minutes.

GPSS model

GPSS World Simulation Report - 2mech.18.1 Title GPSS World Simulation Report - 2mech.18.1 Sunday, October 04, 2015 11:59:02 The title line of the standard report is taken from the name of the Model File that produced the report. The Date and Time of the running of the model is also included. General Information START TIME END TIME BLOCKS FACILITIES STORAGES 0.000 480.000 9 0 1·  START TIME. The absolute system clock at the beginning of the measurement period. Utilizations and space-time products are based on the START TIME. The START TIME is set equal to the absolute system clock by a RESET or CLEAR statement. END TIME. The absolute clock time that the termination count became 0. BLOCKS. The number of Block entities in the simulation at the end of the simulation. FACILITIES. The number of Facility entities in the simulation at the end of the simulation. STORAGES. The number of Storage entities in the simulation at the end of the simulation. NAME VALUE MECHANIC 10000.000 NAME. User assigned names used in your GPSS World model since the last Translation. VALUE. The numeric value assigned to the name. System assigned numbers start at 10000.

Blocks       LABEL. Alphanumeric name of this Block if given one. LOC. Numerical position of this Block in the model. "Location". BLOCK TYPE. The GPSS Block name. ENTRY COUNT. The number of Transactions to enter this Block since the last RESET or CLEAR statement or since the last Translation. CURRENT COUNT. The number of Transactions in this Block at the end of the simulation. RETRY. The number of Transactions waiting for a specific condition depending on the state of this Block entity.

Queues       QUEUE. Name or number of the Queue entity. MAX. The maximum content of the Queue entity during the measurement period. A measurement period begins with the Translation of a model or the issuing of a RESET or CLEAR command. CONT. The current content of the Queue entity at the end of the simulation period. ENTRY. Entry count. The total count of Queue entries during the measurement period. ENTRY(0). "Zero entry" count. The total count of Queue entries with a 0 residence time. AVE.CONT. Queue average length of the AVE.TIME. The average time per unit of Queue content utilized during the measurement period. AVE.(-0). The average time per unit of Queue content utilized during the measurement period, adjusted for "zero entries". The space-time product divided by (the total entry count less the zero entry count). RETRY. The number of Transactions waiting for a specific condition depending on the state of this Queue entity.

Storages STORAGE. Name or number of the Storage entity. CAP. The Storage capacity of the Storage entity defined in the STORAGE statement. REM. The number of unused Storage units at the end of the simulation. MIN. The minimum number of Storage units in use during the measurement period. A measurement period begins with the Translation of a model. MAX. The maximum number of Storage units in use during the measurement period. ENTRIES. The number of "entries" into the Storage entity during the measurement period. AVL. The availability state of the Storage entity at the end of the simulation. 1 means available, 0 means unavailable. AVE.C. The time weighted average of the Storage content during the measurement period. Average number of services. UTIL. The fraction of the total space-time product of the Storage entity utilized during the measurement period. RETRY. The number of Transactions waiting for a specific condition depending on the state of this Storage entity. DELAY. The number of Transactions waiting to enter ENTER blocks on behalf of this Storage entity.

Standard Reports http://www.minutemansoftware.com/refer ence/r11.htm

Arena model

a) The percentage of time that the machine is used. Example III. FOR YOU!!! There is only one copying machine in the student lounge of the business school. Students arrive at the rate of λ = 40 per hour (according to a Poisson distribution). Copying takes an average of 40 seconds, or μ = 90 per hour (according to an exponential distribution). Compute the following: a) The percentage of time that the machine is used. b) The average length of the queue. c) The average number of students in the system. d) The average time spent waiting in the queue. e) The average time in the system.

Thank you for attention!