Table 2: Experimental results for linear ELP

Slides:



Advertisements
Similar presentations
Waiting Line Management
Advertisements

Queuing Theory For Dummies Jean-Yves Le Boudec 1.
Aditya Zutshi Sriram Sankaranarayanan Ashish Tiwari TIMED RELATIONAL ABSTRACTIONS FOR SAMPLED DATA CONTROL SYSTEMS.
Simulation of multiple server queuing systems
Queuing Theory For Dummies
Linear vs. exponential growth Linear vs. exponential growth: t = 0 A = 1x(1+1) 0 = 1 A = 1x0 + 1 = 1.
Linear Programming Special Cases Alternate Optimal Solutions No Feasible Solution Unbounded Solutions.
Waiting Line Management
2003 Fall Queuing Theory Midterm Exam(Time limit:2 hours)
Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
1 Stochastic Modeling for Clinical Scheduling by Ji Lin Reference: Muthuraman, K., and Lawley, M. A Stochastic Overbooking Model for Outpatient Clinical.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Module C9 Simulation Concepts. NEED FOR SIMULATION Mathematical models we have studied thus far have “closed form” solutions –Obtained from formulas --
19-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.

Choose functions using sets of ordered pairs EXAMPLE 1 Use a graph to tell whether the ordered pairs represent a linear function, an exponential function,
Service Operations and Waiting Lines Dr. Everette S. Gardner, Jr.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
Statistical Distributions
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Chapter 10 Introduction to Simulation Modeling Monte Carlo Simulation.
Chap. 4 Continuous Distributions
Capacity analysis of complex materials handling systems.
Mean and Standard Deviation of Grouped Data Make a frequency table Compute the midpoint (x) for each class. Count the number of entries in each class (f).
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.
Discrete Probability Distributions. Random Variable Random variable is a variable whose value is subject to variations due to chance. A random variable.
Optimal XOR Hashing for a Linearly Distributed Address Lookup in Computer Networks Christopher Martinez, Wei-Ming Lin, Parimal Patel The University of.
Homework Questions. Number Patterns Find the next two terms, state a rule to describe the pattern. 1. 1, 3, 5, 7, 9… 2. 16, 32, 64… 3. 50, 45, 40, 35…
OMSAN LOJİSTİK. Top Management Program in Logistics & Supply Chain Management (TMPLSM) Production and Operations Management 3: Process Analysis.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Mean inter-arrival time = 1/Ri = 1/R  Probability that the time between two arrivals.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
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.
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.
3 Continuous RV.
1 Guard Channel CAC Algorithm For High Altitude Platform Networks Dung D. LUONG TRAN Minh Phuong Anh Tien V. Do.
CS 450 – Modeling and Simulation Dr. X. Topics System Analysis Arrival process The Queue The Server The simulation.
MATB344 Applied Statistics I. Experimental Designs for Small Samples II. Statistical Tests of Significance III. Small Sample Test Statistics Chapter 10.
1 1 Slide Continuous Probability Distributions n The Uniform Distribution  a b   n The Normal Distribution n The Exponential Distribution.
Property of Logarithms If x > 0, y > 0, a > 0, and a ≠ 1, then x = y if and only if log a x = log a y.
5 - 1 © 2000 Prentice-Hall, Inc. Statistics for Business and Economics Continuous Random Variables Chapter 5.
Queuing Models.
Simulation of single server queuing systems
1 Ardavan Asef-Vaziri Jan.-2016Basics Probability Distributions- Uniform.
Modeling and Simulation
Module D Waiting Line Models.
WAITING LINES AND SIMULATION
18 Management of Waiting Lines
11.3 Areas of Circles and Sectors
6.4 Logarithmic & Exponential Equations
Queuing Theory Non-Markov Systems
B.Ramamurthy Appendix A
COMPARING EXPONENTIAL AND LINEAR FUNCTIONS
Queuing models Basic definitions, assumptions, and identities
Delays Deterministic Stochastic Assumes “error free” type case
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
Queuing models Basic definitions, assumptions, and identities
Physics-based simulation for visual computing applications
Variability 8/24/04 Paul A. Jensen
The Variance How to calculate it.
Queuing Theory By: Brian Murphy.
Waiting Lines Waiting lines are non-value added occurrences.
Delays Deterministic Stochastic Assumes “error free” type case
Quadratic Equations.
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
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.
Fall Final Topics by “Notecard”.
1.) What is the value of the discriminant?
Exponential Verses Linear
13 – Exponential vs. Linear Functions Calculator Required
Presentation transcript:

Table 2: Experimental results for linear ELP M = 5 facilities l max(M) - arrival rate for the busiest facility EFC Gap Coverage Radius Beta(2,2) Beta(.5,.5) Beta(.25,2) Uniform 0.110 0.253 0.271 0.718 0.2 0.263 0.353 2.590 0.120 0.245 0.244 0.654 0.227 0.221 2.271 0.130 0.240 0.225 0.571 0.200 0.126 1.853 0.150 0.228 0.205 0.365 0.140 0.024 0.824 0.175 0.217 0.311 0.084 0.000 0.554 0.277 0.023 0.385 0.300 0.232 0.159 0.400 0.226 0.132 0.500 0.220 0.099 0.600 0.211 0.055 M = 10 facilities Arrival rate for the busiest facility 0.158 0.599 0.1 0.324 0.575 4.987 0.060 0.125 0.128 0.527 0.254 0.282 4.273 0.065 0.122 0.109 0.406 0.219 0.086 3.062 0.075 0.115 0.101 0.146 0.010 1.632 0.088 0.112 0.100 0.207 0.121 1.073 0.178 0.098 0.779 0.102 0.136 0.019 0.360 0.224 0.250 0.147 M = 20 facilities 0.028 0.077 0.081 0.05 0.535 0.627 3.645 0.030 0.071 0.062 0.144 0.418 0.241 1.878 0.033 0.057 0.145 1.245 0.038 0.050 0.008 0.768 0.044 0.053 0.063 0.052 0.049 0.051 0.011 Table 2: Experimental results for linear ELP Table 3: % Difference in optimal costs for the capacity computed using Large Deviation Bound vs. optimal costs for the capacity computed using exact formula for the exponential service and using a queuing simulator for the non-exponential service.

Table 4(a): Properties of the optimal solution (averages) for different service time distributions and waiting time bounds Table 4(b): Properties of the optimal solution (averages) for cost ratios and coverage radii Table 5: EFC properties of the optimal location vector. For the cases where the optimal vector is not EFC, “EFC Gap” measures the excess “structural capacity” in the system