MGS3100_08.ppt/Dec 8, 2014/Page 1 Georgia State University - Confidential MGS 3100 Business Analysis Simulation Dec 8, 2014.

Slides:

Advertisements

Similar presentations

Introduction Queuing is the study of waiting lines, or queues.

Advertisements

Waiting Line Management

生醫統計學期末報告 Distributions 學生：劉俊成學號：授課老師：蔡章仁.

Probability Three basic types of probability: Probability as counting

Chapter 10: Simulation Modeling

(Monté Carlo) Simulation

Chapter 4 Mathematical Expectation.

A.P. STATISTICS LESSON 7 – 1 ( DAY 1 ) DISCRETE AND CONTINUOUS RANDOM VARIABLES.

Discrete Probability Distributions Chapter 6 Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.

Review of Probability Distributions

Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.

Math Review Data Analysis and Probability. Possible Outcomes... Tossing a coin.

Introduction to Probability and Statistics

14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.

Simulation Examples Continued

Chapter 9: Queuing Models

Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.

The Cereal Box Problem By Narineh Movsessian. Random or Chance Outcomes SHow much precipitation is expected next year in the Kansas wheat belt? SHow many.

Calculating Probabilities for Chance Experiments with Equally Likely Outcomes.

McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 4 and 5 Probability and Discrete Random Variables.

Copyright warning. COMP5348 Lecture 6: Predicting Performance Adapted with permission from presentations by Alan Fekete.

©The McGraw-Hill Companies, Inc. 2008McGraw-Hill/Irwin Probability Distributions Chapter 6.

Discrete Probability Distributions Chapter 06 McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved.

5-1 Business Statistics: A Decision-Making Approach 8 th Edition Chapter 5 Discrete Probability Distributions.

Chapter 14 Simulation. What Is Simulation? Simulation is to mimic a process by using computers.

4.1 Probability Distributions. Do you remember? Relative Frequency Histogram.

1 QUEUES. 2 Definition A queue is a linear list in which data can only be inserted at one end, called the rear, and deleted from the other end, called.

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.

Example simulation execution The Able Bakers Carhops Problem There are situation where there are more than one service channel. Consider a drive-in restaurant.

Queuing Theory. Introduction Queuing is the study of waiting lines, or queues. The objective of queuing analysis is to design systems that enable organizations.

Chapter 16 Capacity Planning and Queuing Models

Discrete Probability Distributions Chapter 06 McGraw-Hill/Irwin Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved.

Lesson Objective Understand how we can Simulate activities that have an element of chance using probabilities and random numbers Be able to use the random.

1.3 Simulations and Experimental Probability (Textbook Section 4.1)

The Practice of Statistics Third Edition Chapter 7: Random Variables Copyright © 2008 by W. H. Freeman & Company Daniel S. Yates.

Advance Waiting Line Theory and Simulation Modeling.

Discrete Probability Distributions. What is a Probability Distribution? Experiment: Toss a coin three times. Observe the number of heads. The possible.

1.4 Equally Likely Outcomes. The outcomes of a sample space are called equally likely if all of them have the same chance of occurrence. It is very difficult.

Simulation Continuous Vars Dr. Satish Nargundkar 1 Monte Carlo Simulation Continuous Variables.

List one thing that has a probability of 0?. agenda 1) notes on probability 2) lesson 1 example 1, 2 Exercise 5-8 Problem set 1-3 3)start lesson 3.

Computer Simulation. The Essence of Computer Simulation A stochastic system is a system that evolves over time according to one or more probability distributions.

Your 3rd quiz will cover sections a){HHH,HTT,THT,TTH,THH,HTH,HHT,TTT} {0,1,2,3} b) {1/8,3/8,3/8,1/8} d) P(x=2 or x=3)= P(x=2)+P(x=3)=3/8+1/8=1/2.

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.

Section 11.8 GEOMETRIC PROBABILITY. General Probability.

Simulation Chapter 9 Discrete Variables. Course Overview.

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.

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.

Problem #7 To support National Heart Week, the Heart Association plans to install a free blood pressure testing booth in El Con Mall for the week. Previous.

Probability Quiz. Question 1 If I throw a fair dice 30 times, how many FIVES would I expect to get?

Homework Questions. Simulations Unit 6 Experimental Estimates As the number of trials in an experiment increases, the relative frequency of an outcome.

Simulation Discrete Variables. What is it? A mathematical model Probabilistic Uses the entire range of possible values of a variable in the model.

Probability Quizzes and Games Week of April 4-8, : Relate theoretical probability to experimental results.

Queuing Models.

How likely is something to happen..  When a coin is tossed, there are two possible outcomes: heads (H) or tails (T) We say the probability of a coin.

Chapter5 Statistical and probabilistic concepts, Implementation to Insurance Subjects of the Unit 1.Counting 2.Probability concepts 3.Random Variables.

Computer Simulation Henry C. Co Technology and Operations Management,

WAITING LINES AND SIMULATION

Prepared by Lloyd R. Jaisingh

MGS 3100 Business Analysis Simulation Apr 21, 2016

ETM 607 – Spreadsheet Simulations

Historical Distribution

2.7: Simulation.

Queuing Theory Queuing Theory.

Chapter 9: Queuing Models

Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.

Simulation Continuous Variables Simulation Continuous Vars

Queuing Analysis.

Suppose I have ordered 140 Unities.

Data Analysis and Probability

Displaying data in Stem-and-Leaf Plots and Histograms

Presentation transcript:

MGS3100_08.ppt/Dec 8, 2014/Page 1 Georgia State University - Confidential MGS 3100 Business Analysis Simulation Dec 8, 2014

MGS3100_08.ppt/Dec 8, 2014/Page 2 Georgia State University - Confidential Agenda ProblemsSimulation

MGS3100_08.ppt/Dec 8, 2014/Page 3 Georgia State University - Confidential Simulation What is a simulation? What does random mean? Benefits to simulation: –Time can be compressed –Simulations do not disrupt ongoing activities of the real system –Simulations can be used to analyze transient (infrequent) conditions –Developing a simulation model can lead to better understanding of the real system

MGS3100_08.ppt/Dec 8, 2014/Page 4 Georgia State University - Confidential Types of Simulations Simulation Discrete 2-Value Multi- Valued Continuous

MGS3100_08.ppt/Dec 8, 2014/Page 5 Georgia State University - Confidential Types of Simulations 2-Value: Coin Toss Create a column of random numbers from 0 to 1 How would you assign a value to heads and tails? HeadsTails

MGS3100_08.ppt/Dec 8, 2014/Page 6 Georgia State University - Confidential Types of Simulations Multi-Valued Suppose we put 100 colored balls in a bag and randomly pull them out. Color# ProbabilityCumulative Red25 25%.25 Blue42 42%.67 Yellow33 33% 1.0 RedBlueYellow =if(f7<=c$7,“Red”,if(f7<=c$8,“Blue”,“Yellow”))

MGS3100_08.ppt/Dec 8, 2014/Page 7 Georgia State University - Confidential Types of Simulations Multi-Valued Using vlookup, where does Red start? Grades example. –Equal distribution of grades A through F: =randbetween(50,100) FDCBA

MGS3100_08.ppt/Dec 8, 2014/Page 8 Georgia State University - Confidential Agenda Simulations Problems

MGS3100_08.ppt/Dec 8, 2014/Page 9 Georgia State University - Confidential Problem 1 Jimmy prints a neighborhood newspaper. He has 10 subscribers. He also sells it to whoever comes by, from his front lawn on Friday afternoons. His mother has kept track of his demand (including requests made after he had sold out) for the past 100 weeks, and observed the following pattern: The papers cost 30 cents to print and Jimmy sells them for 50 cents. Assume that he prints 20 copies a week. Mom makes him throw away unsold copies. Simulate his sales for a year and determine his earnings. What if the # printed were adjusted? Papers DemandedNumber of weeks Total100

MGS3100_08.ppt/Dec 8, 2014/Page 10 Georgia State University - Confidential Problem 2 – Queuing System Trucks arrive at a loading dock on average every 0.6 hours. It takes on average 0.5 hours to unload a truck. Assuming that arrival intervals and service times are exponentially distributed, simulate the queuing system to find the average waiting times and the average number of trucks in the queue/system. Suppose you could install an new conveyor belt system to unload trucks faster, so that the average unloading time is cut to 0.25 hours. How much improvement will there be in the average waiting time and average number in queue/system? Queuing systems consist of multiple inputs:  Number of servers, Number of Queues  Arrival rate/Arrival interval  Service rate/Service time And multiple outputs:  Average wait time  Average number in queue / system

MGS3100_08.ppt/Dec 8, 2014/Page 11 Georgia State University - Confidential Problem 2 – Queuing System SSSQ – simplest SSMQ MSSQ MSMQ Examples of each? Arrive in queue Service begins Service ends Wait time in queueService time Wait time in system

MGS3100_08.ppt/Dec 8, 2014/Page 12 Georgia State University - Confidential Exponential Distribution Take Random # Take the negative logarithm of random #, and multiply by average desired After looking at histogram, why can’t we break-down distribution to exact probabilities?