We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byEarl Corner
Modified over 2 years ago
Lab Module 05 Entity RoutingCopyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Objectives and OutlineLab Objectives Continue learning basic Simio modeling Learn two different methods to route entities in Simio Link Selection Weights Dynamic routing using node lists Lab Outline Video 1 – Using Selection Weights for probabilistic routing Video 2 – Using Selection Weights for conditional routing Video 3 – Using Node Lists for dynamic routing Video 4 – Assignments Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Video 1 – Using Selection Weights for RoutingAdjust Arrive Inspect Depart 80% Pass 20% Fail TV final adjustment and inspection process TVs arrive at the rate of 20/hour (exponential interarrival times) Adjustment takes approximately 2 minutes (uniformly distributed between 1.75 and 2.25) Inspection takes approximately 1.75 minutes (exponentially distributed) 20% of inspected TVs are found to need re-adjustment Interested in Time In System, Number In System, Utilizations of Adjust and Inspect Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Re-entrant Flow and Effective Arrival Ratep l 1-p 𝜆 ′ =𝜆+𝑝 𝜆 ′ 𝜆 ′ = 𝜆 1−𝑝 Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Selection Weights 𝑝 𝑖 = 𝑤 𝑖 𝑗=1 𝑛 𝑤 𝑗wn Link selection probability for link i : 𝑝 𝑖 = 𝑤 𝑖 𝑗=1 𝑛 𝑤 𝑗 Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Video 2 – Conditional Routing Using Selection WeightsMaximum of 3 adjustments for a given TV Adjust Arrive Inspect Depart 80% Pass 20% Fail TV final adjustment and inspection process TVs arrive at the rate of 20/hour (exponential interarrival times) Adjustment takes approximately 2 minutes (uniformly distributed between 1.75 and 2.25) Inspection takes approximately 1.75 minutes (exponentially distributed) 20% of inspected TVs are found to need re-adjustment Interested in Time In System, Number In System, Utilizations of Adjust and Inspect Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Video 3 – Dynamic Routing Using Node ListsServer1 Arrive Depart Server2 Server3 Approx. 10 minutes Approx. 5 minutes Approx. 1 minute Arrival rate: 60/hour Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Video 4 - Assignment Using the TV Adjust/Inspect model:“Fix” the issue where the TV’s are adjusted the 4th (and inspected) time even though we know that they will be rejected after inspection. Hint: Start by inserting a Basic Node in the path from the Inspect server back to the Adjust server. Create a reference property for the maximum number of adjustments allowed and develop an experiment that compares the configurations with values 1, 2, 3, 4, 5, 100. Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Video 4 - Assignment Using the dynamic routing model (from the third video): Develop an experiment with 25 replications using a run length of 500 hours with a 250 hour warm-up and responses for the three server utilizations, the entity time in system (TIS) and entity number in system (NIS) Using the base model, compare the 5 performance metrics using the following routing alternatives: Probabilistic routing using the selection weights 6/78, 12/78, and 60/78 Preferred order with capacity 5 buffers at each server Using AssociatedStationOverload with no buffers (capacity 0 buffers) Using AssociatedStationOverload with capacity 5 buffers Using the shortest queue length with infinite capacity buffers Copyright © Jeffrey S. Smith and Simio LLC | All Rights Reserved
Lab Module 02 Serial Manufacturing Line
Lab Module 03 Serial Manufacturing Line – Part II
Lab Module 11 Vehicles and Conveyors
Lab Module 04 More on Simio Animation
Lab Module 10 Simulation-based Optimization
Copyright © Jeffrey S. Smith | All Rights Reserved
Lab Module 9 User-defined Statistics
Lab Module 06 Routing with Sequences
Part 3 Probabilistic Decision Models
Waiting Line Management
1 Ardavan Asef-Vaziri Oct. 2011Operations Management: Waiting Lines 1 Polling: Lower Waiting Time, Longer Processing Time (Perhaps) Waiting Lines.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Queuing Analysis Chapter 13.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
1 Performance Evaluation of Computer Networks Objectives Introduction to Queuing Theory Little’s Theorem Standard Notation of Queuing Systems Poisson.
8/24/04 Paul A. Jensen Operations Research Models and Methods Copyright All rights reserved Material Movement The movement of material through the.
Graduate Program in Engineering and Technology Management
Julian Archer Shannon Cummings Ashley Green David Ong.
Simulation and Analysis of Entrance to Dahlgren Naval Base Jennifer Burke MSIM 752 Final Project December 3, 2007.
Discrete Event (time) Simulation Kenneth.
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),
EVOLUTION OF INDUSTRIAL ENGINEERING Prof. Dr. Orhan TORKUL Res. Asst. M. Raşit CESUR Res. Asst. Furkan YENER.
Capacity Planning and Queuing Models
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.
Introduction to Arena A Simple Simulation. Model1 We examine a simple model: parts arrive at a server, are served, and depart the system. There will be.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
Chapt 6 Resources & Gates Intro/ steps in the process Distributions...What & Why Resource Block Await Node Free node Alter node Group block Open Node Close.
Internet Queuing Delay Introduction How many packets in the queue? How long a packet takes to go through?
1 By Terence James Haydock Manufacturing Cell A simulated response in Arena.
Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory Queueing Models Kendall notation.
Structure of a Waiting Line System
Reliability McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 10. Simulation An Integrated Approach to Improving Quality and Efficiency Daniel B. McLaughlin Julie M. Hays Healthcare Operations Management.
Three Key Process Measures: Flow Rate
Intro to Arena A Second Simulation.
6/12/2016© 2010 Raymond P. Jefferis IIILect The Network Layer.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
1 6.3 Binary Heap - Other Heap Operations There is no way to find any particular key without a linear scan through the entire heap. However, if we know.
Copyright 2010 Simio LLC | All rights reserved. 1 Learning Simio Chapter 10 Analyzing Input Data.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 75.
Queuing Theory and Traffic Analysis Based on Slides by Richard Martin.
Ch. 12 Routing in Switched Networks
1 Stochastic Modeling for Clinical Scheduling by Ji Lin Reference: Muthuraman, K., and Lawley, M. A Stochastic Overbooking Model for Outpatient Clinical.
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Module 2.0: Modeling of Network Components. Queueing theory Basics : average number of packets 1/ : mean service time per packet [s] arriving per.
Simulation of multiple server queuing systems
© 2017 SlidePlayer.com Inc. All rights reserved.