© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J. 07458 F-1 Operations Management Simulation Module F.

Slides:



Advertisements
Similar presentations
McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. A PowerPoint Presentation Package to Accompany Applied Statistics.
Advertisements

Introduction into Simulation Basic Simulation Modeling.
Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
BA 452 Lesson C.2 Waiting Line Simulation 1 ReadingsReadings Chapter 12 Simulation.
(Monté Carlo) Simulation
MGTSC 352 Lecture 23: Inventory Management Big Blue Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems,
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.
CS433 Modeling and Simulation Lecture 11 Monté Carlo Simulation Dr. Anis Koubâa 05 Jan 2009 Al-Imam Mohammad Ibn.
MGT 560 Queuing System Simulation Stochastic Modeling © Victor E. Sower, Ph.D., C.Q.E
Module F: Simulation. Introduction What: Simulation Where: To duplicate the features, appearance, and characteristics of a real system Why: To estimate.
© 2006 Prentice Hall, Inc.F – 1 Operations Management Module F – Simulation © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
Queuing Systems Chapter 17.
Chapter 13 Queuing Theory
Building and Running a FTIM n 1. Define the system of interest. Identify the DVs, IRVs, DRVs, and Objective. n 2. Develop an objective function of these.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 15-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 15.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Introduction to Simulation. What is simulation? A simulation is the imitation of the operation of a real-world system over time. It involves the generation.
Management of Waiting Lines
Performance Evaluation
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Chapter 14 Simulation. Monte Carlo Process Statistical Analysis of Simulation Results Verification of the Simulation Model Computer Simulation with Excel.
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
Project 2: ATM’s & Queues
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 6-1 Chapter 6 The Normal Distribution and Other Continuous Distributions.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
1 1 Slide Chapter 6 Simulation n Advantages and Disadvantages of Using Simulation n Modeling n Random Variables and Pseudo-Random Numbers n Time Increments.
Operations Management
SIMULATION An attempt to duplicate the features, appearance, and characteristics of a real system Applied Management Science for Decision Making, 1e ©
Simulation Pertemuan 13 Matakuliah :K0442-Metode Kuantitatif
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
Simulation Examples ~ By Hand ~ Using Excel
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
F - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall F F Simulation PowerPoint presentation to accompany Heizer and Render Operations Management,
Project 2: ATM’s & Queues. ATM’s & Queues  Certain business situations require customers to wait in line for a service Examples:  Waiting to use an.
Discrete Distributions The values generated for a random variable must be from a finite distinct set of individual values. For example, based on past observations,
Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.
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.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Example simulation execution The Able Bakers Carhops Problem There are situation where there are more than one service channel. Consider a drive-in restaurant.
Chapter 16 Capacity Planning and Queuing Models
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
To accompany Quantitative Analysis for Management, 7e by Render/Stair 13-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Quantitative Analysis.
Simulation OPIM 310-Lecture #4 Instructor: Jose Cruz.
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Simulation Examples and General Principles
Simulation Using computers to simulate real- world observations.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations.
Simulation is the process of studying the behavior of a real system by using a model that replicates the system under different scenarios. A simulation.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Waiting Lines and Queuing Theory Models
Simulation. Introduction What is Simulation? –Try to duplicate features, appearance, and characteristics of real system. Idea behind Simulation –Imitate.
Simulation Chapter 16 of Quantitative Methods for Business, by Anderson, Sweeney and Williams Read sections 16.1, 16.2, 16.3, 16.4, and Appendix 16.1.
(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.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
Simulation. Types of simulation Discrete-event simulation – Used for modeling of a system as it evolves over time by a representation in which the state.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 15-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Prepared by.
Simulation of single server queuing systems
Chapter 2 Simulation Examples. Simulation steps using Simulation Table 1.Determine the characteristics of each of the inputs to the simulation (probability.
Managerial Decision Making Chapter 13 Queuing Models.
Simulation Modeling.
Simulasi sistem persediaan
Computer Simulation Henry C. Co Technology and Operations Management,
Prepared by Lloyd R. Jaisingh
Modeling and Simulation (An Introduction)
ADVANTAGES OF SIMULATION
Simulation Modeling.
Presentation transcript:

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-1 Operations Management Simulation Module F

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-2 Two ways to address waiting lines  Queuing theory  Certain types of lines can be described mathematically  Requires that assumptions are valid for your situation  Systems with multiple lines that feed each other are too complex for queuing theory  Simulation  Building mathematical models that attempt to act like real operating systems  Real-world situations can be studied without imposing on the actual system

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-3 Simulation  Imitate a real-world situation mathematically  Study its properties and operating characteristics  Draw conclusions and make action recommendations  Benefits:  Able to handle complex situations with multiple unknowns, non-standard distributions, and different interactions  Fast  Low cost  Low risk

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-4 Real World Variables Which Are Probabilistic in Nature  Inventory demand  Lead time for orders to arrive  Time between machine breakdowns  Times between arrivals at a service facility  Service times  Times to complete project activities  Number of employees absent from work each day

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-5 New Orleans Barge Unloading Simulation Following long trips down the Mississippi River from industrial mid-western cities, fully loaded barges arrive in New Orleans. Distribution 1 gives the inter-arrival times for the barges. Distribution 2 gives the unloading times.

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-6 Table of Random Numbers

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-7 Distribution 1 – Inter-Arrival Times Time Between Arrivals (Hours) ProbabilityCumulative Probability Random Number Interval – – – –

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-8 Distribution 2 – Unloading Times Unloading Times (Hours) ProbabilityCumulative Probability Random- Number Interval – – – –

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-9 New Orleans Barge Unloading Simulation From Dist 1From Dist 2 From Random Number Table Waiting Time Unloading Ends Unloading Time Unloading Starts Arrival Time Int Arr Time Rnd #

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-10 New Orleans Barge Unloading Simulation Average Time in Port 11.3 hrs17.1 hrs Average Wait Time (Hours) Total Wait Time (Hours) Average Time to Unload (Hours) Average Time Between Arrivals (Hours) 15.7 hrs hrs 4.4 hrs 40 hrs / 940 hrs102 hrs / 9154 hrs / 9

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-11 Simulation Using Excel RAND ( ) = We can create specific distributions, e.g. the normal distribution: NORMINV ( RAND ( ), mean, standard deviation ) We can use if / then statements: = IF ( X < Y, value if true, value if false)

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-12 Metric Construction Metric Construction is trying to determine the expected profit for a project. If they finish on time, they will make a $550,000 profit. For every week the project is early, they gain an additional $50,000. For every week late, they lose $60,000. The project is to be completed in 120 weeks. A labor strike is possible with their upcoming contract negotiations. The labor relations staff has estimated the probability of no strike at 45%, the probability of a 3-week strike is 25%, a 4-week strike is 15%, a 5-week strike is 10%, and a 6-week strike is 5%. Metric based their 120 week completion time on the average number of rainy days. Based on weather service input, they estimate a normal distribution for rainy days with a mean of 0 (from their 120-week schedule) and a standard deviation of 20 weeks.

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-13 Metric Construction Model Parameters (given information) Profit = 550,000 + (50,000*weeks early) – (60,000*weeks late) Generate Length of Strike, S Generate weather effect, W Expected completion = S + W Compute Profits repeat

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-14 Metric Construction – The Strike The labor relations staff has provided us with the probability distribution for a strike. We can use the random number generator just like we did for the New Orleans barge unloading problem. Use nested if statements:  If random number <.45 S = 0  If random number >.45 and <.70 S = 3  If random number >.70 and <.85 S = 4  If random number >.85 and <.95 S = 5  If random number >.95 S = 6 = IF (C3 < 0.45, 0, IF (C3 < 0.70, 3, IF (C3 < 0.85, 4, IF (C3 < 0.95, 5, 6 ))))

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-15 Metric Construction – The Weather We will use a normal distribution for weather delay. Our mean is 0 (from our current schedule) and the standard deviation is 20 weeks: = NORMINV ( RAND ( ), 0, 20 ) We may want to round this to an integer

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-16 Metric Construction – Continuing  Completion time for the project will be 120 weeks plus the strike plus the weather change (note when this is negative it decreases project length which is a good thing) L = S + W  Profits = $550,000 + $50,000 week early – $60,000 week late If L > 120 = 550,000 – 60,000 (L – 120) If L < 120 = 550, ,000 (120 – L)  Lets run this thing for 50 weeks

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-17 Metric Construction – The Results  50 trials (and we could easily do 500) is much more informative than plugging in average, best and worst cases.  Fast to complete and fast to re-run with modified assumptions

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-18 Billy-Bob’s Bait Shack Billy-Bob’s Bait Shack is trying to decide between two different ways of serving customers. Presently, Billy-Bob and his willing assistant Bubba work as a team. When a customer enters the bait shack, one person gets the bait while the other rings up the purchase and collects the money. In this system, customers arrive following a uniform distribution with a range from 0 – 15 minutes. The team of Billy-Bob and Bubba service customers following a standard distribution with an average time of 6 minutes and a standard deviation of 2 minutes. In the proposed system, Billy-Bob and Bubba will each do everything for a customer, creating two servers. Customers will wait in a single line. Service will still follow a normal distribution, but now the average time will be 11 minutes, with a standard deviation of 3 minutes. When both servers are available, Billy-Bob will take the next customer.

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-19 Initialize model: i = 0, arrival time (0) = 0, completion time (0) = 0 New customer: i = i+1 Arrival time(i) = arrival time (i-1) + IAT Wait? No - AT(i) > CT(i-1)Yes - AT(i) < CT(i-1) Start (i) = AT(i)Start (i) = CT(i-1) Wait (i) = S(i) – AT(i) Generate processing time – p(i) Completion time: CT(i) = S(i) + p(i) System time = CT(i) – AT(i) Generate inter-arrival time (IAT) Billy-Bob’s Bait Shack

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-20 Arrivals Inter-arrival time is uniformly distributed between 0 and 15 minutes Value = a + [ random number * ( b – a ) ] a = smallest possible value b = largest possible value In this case: IAT(i) = RAND( ) * 15 AT(i) = AT(i – 1) + IAT(i) Billy-Bob’s Bait Shack

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-21 We have to wait when the customer ahead of us is not completed with service when we arrive  If AT(i) < CT(i-1) then AT(i) has to wait start time: S(i) = CT(i-1)  If AT(i) > CT(i-1) then AT(i) does not have to wait start time: S(i) = AT(i)  Start time = if ( AT(i) < CT(i – 1), CT(i – 1), AT(i) )  Wait time: W(i) = S(i) – AT(i) Billy-Bob’s Bait Shack Waiting

© 2004 by Prentice Hall, Inc., Upper Saddle River, N.J F-22 The rest  Processing time is normally distributed with a mean of 6 minutes and a standard deviation of 2 minutes  p(i) = NORMINV ( RAND( ), 6, 2 )  Completion time = when this transaction is completed  CT(i) = S(i) + p(i)  System time = time from entering the system to leaving the system  CT(i) – AT(i) Billy-Bob’s Bait Shack