Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. A PowerPoint Presentation Package to Accompany Applied Statistics.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Where is There Waiting? Service Facility –Fast-food restaurants –Post office –Grocery store.
Capacity Setting and Queuing Theory
11–1. 11–2 Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
MGTSC 352 Lecture 23: Inventory Management Big Blue Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems,
© The McGraw-Hill Companies, Inc., 1998 Irwin/McGraw-Hill 2 Chapter 7 TN Waiting Line Management u Waiting line characteristics u Some waiting line management.
Event-drive SimulationCS-2303, C-Term Project #3 – Event-driven Simulation CS-2303 System Programming Concepts (Slides include materials from The.
Waiting Lines Example-1
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.
Waiting Lines and Queuing Theory Models
© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.
Chapter 13 Queuing Theory
Management of Waiting Lines
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Graduate Program in Engineering and Technology Management
Queuing Theory (Waiting Line Models)
Buffer or Suffer Principle
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Queuing Models and Capacity Planning
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
1-1 1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved.
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
(C) 2009 J. M. Garrido1 Object Oriented Simulation with Java.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Supplement D Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 3rd Edition © Wiley 2005 PowerPoint Presentation by Roger B. Grinde,
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.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Supplement C Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.
IE 429, Parisay, January 2010 What you need to know from Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete,
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
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.
Chapter 16 Capacity Planning and Queuing Models
Supplement D Waiting Line Models
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
1 Modeling and Simulating Business Processes Chapter 8 Business Process Modeling, Simulation and Design.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
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.
Chapter 6 Queueing Models
Dr. Anis Koubâa CS433 Modeling and Simulation
(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.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Queuing Models.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.
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.
Chapter 1 What is Simulation?. Fall 2001 IMSE643 Industrial Simulation What’s Simulation? Simulation – A broad collection of methods and applications.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Lecture 14 – Queuing Networks
Chapter 5 Process Analysis. Chapter 5 Process Analysis.
Prepared by Lloyd R. Jaisingh
Supplement C Developing the Master Production Schedule
Modeling and Simulation (An Introduction)
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Chapter 9: Queuing Models
Chapter 9 Integer Programming
Chapter 20 Queuing Theory
DECISION MODELING WITH Prentice Hall Publishers and
Supplement D Waiting Line Models
Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry
Lecture 14 – Queuing Networks
Presentation transcript:

Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc.

2 Description In Chapter 9 we learned how to build simulation models of many different situations. In this chapter we will explain how the powerful, user- friendly simulation package Process Model can be used to simulate queuing systems.

Simulating an M/M/1 Queuing System After installing Process Model you can start it by selecting Start – Programs – Process Model. You will see the process model screen appear. The book contains a labeled diagram showing key icons. Process Model is an easy to use software that allows you to simulate queuing systems. To simulate a M/M/1 queuing systems having λ=10 arrivals/hour and µ=15 customers/hour. (See the file MM1.igx on the cd from the book.)

4 The book walks you through the steps of creating the model. During the simulation an on-screen scoreboard tracks the following quantities:  Quality Processed-Total Number of units to leave system  Cycle Time-Average time a unit spends in system  Value Added Time-Time which a unit spends in service  Cost Per Unit-If costs are associated with the resources, the cost incurred per unit serviced is computed. After completing the simulation you are asked if you want to view the output. Sample output can be seen in the book.

Simulating a M/M/2 System Let us suppose that we had two telephone operators who can handle calls. To modify the previous example we simply need to change the number of operators to 2 and ensure that up to 2 operators can be working on calls at the same time. See the file MM2.igx. The book contains the output of running this file for 1000 hours.

A Series System This section uses Process Model to simulate a series queuing system. The auto assembly line example used previously will be used.

7 Example The last two things that are done to a car before its manufacture is complete are installing the engine and putting on tires. An average of 54 cars per hour arrive requiring these two tasks. One worker is available to install the engine and can service an average of 60 cars per hour. After the engine is installed, the car goes to the tire station and waits for its tires to be attached Three workers server at the tire station.

8 Each works on one car at a time and can put tires on a car in an average of 3 minutes. Assume interarrival times and service times are exponential. Simulate this system for 400 hours.

9 Solution See the file Carassembly.igx. The key to creating a queuing network with Process Model is to build the diagram one service center at a time. Begin by creating arrivals in Example 1 and then create the engine production center and the tire center. The tire center will need to have the number of servers changed. The system is flexible and can be modeled to accommodate changes in Move Time and other factors.

10 The Effect of a Finite Buffer The output form this model can be found in the book. Suppose we only have enough space for two cars to wait for Tire installation. This is called a buffer of size 2. To model this change the Input Capacity in the Tire Activity dialog box needs to be changed to 2. Running the simulation shows the average wait is 6 hours. Clearly we need more storage space.

Simulating Open Queuing Networks - Example An open queuing network consists of two servers: Server 1 and Server 2. An average of 8 customers per hour arrive from outside at Server 1. An average of 17 customers per hour arrive from outside at Server 2. Interarrival times are exponential. Server 1 can server at an exponential rate of 20 customers per hour and Server 2 can serve at an exponential rate of 30 customers per hour.

12 After completing service at Server 1, half the customers leave the system and half go to Server 2. After completing Service at Server 2 75% of the customers complete service and 25% return to Server 1. Simulate this system for 400 hours.

13 Solution See the file Open.igx. To begin we create two arrival entities: one arrival entity representing external arrivals to Server 1 and one arrival entity representing external arrivals to Server 2. After creating the Servers we use the connector tool to create a link from Server 1 to Server 2, a link Server 2 to Server 1, and a link from Server 2 to Server 1, and a link from Server 1 and 2 to the exiting system.

14 We input the arrival and service rates, move times along with the routing information into the software. The project diagram can be seen in the book. Note as the simulation runs some calls move between the servers and some exit the system! Seeing this movement really makes the concept of an open queuing network come alive!

Simulating Erlang Service Times Service times often do not follow exponential distribution. Usually the Erlang distribution is used to model nonexponential service times. An Erlang distribution can be defined by a mean and a shape parameter k. The shape parameter must be an integer. It can be shown that Standard Deviation of Erlang =

16 Therefore is we know the mean and the standard deviation of the service times we may determine an appropriate value of k. The syntax for generating Erlang service times in Process Model is ER(Mean, k).

What Else Can Process Model Do? A brief description of other modeling features included in Process Model follows:  Bulk Arrivals and Services Often at a restaurant people arrive in groups. This arrival pattern is called bulk arrivals.  Reneging Perhaps people hang up when calling an 800 number if they are put on hold more than 5 minutes. Process Model can model such balking or reneging behavior.  Variation in Arrival pattern At a restaurant or bank arrival rate varies substantially over the course of the day. Variable arrival rate patterns can easily be modeled with Process Model.

18  Variation of Number of Servers During the day workers take breaks and go to lunch. Also many companies vary the number of servers during the day, Process Model can easily model variation in server capacity.  Priorities In an emergency room more seriously ill patients are given priority over earlier arriving less ill patients. Process Model can handle complex priority mechanisms.