|
|
- Frederick Dennis
- 5 years ago
- Views:
Transcription
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34 Hierdie vraestel bestaan uit 4 bladsye plus n bylae met formules (pp. i en ii). Hierdie vraestel bly die eiendom van die Universiteit van Suid-Afrika en mag nie uit die eksamenlokaal verwyder word nie. BEANTWOORD AL DIE VRAE. Vraag Explain the difference between a deterministic simulation model and a stochastic simulation model. Give an example of a real life system which requires development of a stochastic model for its description. (2) 1.2 A sequence of random numbers has two important statistical properties: uniformity and independence. Name two statistical tests for uniformity and two statistical tests for independence. (4) 1.3 Consider a random variable X with the following probability density function: { ax 3 if x [0,1] f(x) = 0 otherwise. Prove that a = 4. Suggest a procedure for generating a random number R from the distribution of the random variable X. (7) [13] [BLAAI OM]
35 2 DSC3703 Oct/Nov 2011 Vraag 2 Rupert sells daily newspapers on a street corner. Each morning he must buy the same fixed number Q of copies at R4 each. He sells them for R7 each through the day. He has noticed that the demand D during the day is close to being a random variable X that is normally distributed with mean µ = 135,7 and standard deviation σ = 27,1, except that D must be a nonnegative integer to make sense. So, D = max{[x]; 0} where [x] is the nearest integer to x. It is also assumed that demands from day to day are independent. Any unsold papers are returned to the publisher for a credit of R2 each. Any unsatisfied demand is estimated to cost R3 per paper in loss of goodwill and profit. Each day starts afresh, independent of any other day. 2.1 Prove that Rupert s profit is given by (2) Profit = 7min{Q; D} + 2max{Q D; 0} 3max{D Q; 0} 4Q. 2.2 Generate the daily demands D 1 and D 2 for two days by sequentially using the U(0; 1) random numbers as given in Appendix A. Show all the steps of the solution (6) 2.3 Assume that Q = 145. Determine the profit for two days with demands D 1 = 139 and D 2 = 154 given in subquestion 2. (2) 2.4 A simulation model for this problem is run for consecutive days for order quantities Q = 100;120;130;140 and 150 respectively. The computer output is given in the table below. Assume that Rupert wants to choose one of these values. Which one would you advise him to take. Substantiate your answer. Also find a 95% confidence interval for the profit for an order quantity of 160. Name Profit Profit Profit Profit Profit Profit Description (Sim#1) (Sim#2) (Sim#3) (Sim#4) (Sim#5) (Sim#6) Order Quantity Minimum Maximum Mean 275,35 307,61 328,43 337,71 336,80 328,03 Std Deviation 60,91 64,67 76,27 91,78 106,75 118,57 (6) [16] [BLAAI OM]
36 3 DSC3703 Oct/Nov 2011 Vraag 3 Five identical machines operate independently in a small shop. Each machine is up (that is, works) for between 6 and 10 hours (uniformly distributed) and then breaks down. There are two repair technicians available, and it takes a technician between 1 and 3 hours (uniformly distributed) to fix a machine; only one technician can be assigned to work on a broken machine even if the other technician is idle. If more than two machines are broken down at a given time, they form a virtual first-in-first-out repair queue and wait for the first available technician. A technician works on a broken machine until it is fixed, regardless of what else is happening in the system. All uptimes and downtimes are independent of each other. Assume that in the beginning all machines are working. This system can be modelled as a queuing system, by considering the machines as customers and the repair technicians as servers. Consider the following variables: TM is the clock time of the simulation, AT is the scheduled time of the next breakdown, DT is the scheduled time of the next repair completion, DT1 is the scheduled time for the next repair completion from Technician 1, DT2 is the scheduled time for the next repair completion from Technician 2, WL is the number of machines waiting in the queue, IT is the time between breakdowns, ST is the service time (time to complete a repair), SS1 is the status of Technician 1 (0 for idle and 1 for busy), SS2 is the status of Technician In building a simulation model for this system, what events should be considered? (2) 3.2 After what time should the technicians expect the first breakdown to happen? Substantiate your answer. (2) 3.3 Give the initial values of the variables TM, DT, DT1, DT2, WL, SS1 and SS2. (3) 3.4 Generate 5 random times at which the first 5 breakdowns will happen and generate corresponding 5 random service times using sequentially the U(0; 1) numbers given in Appendix A (Use U 1 ;...;U 5 to generate the breakdown times and U 6 ;...;U 10 for the service times). At which time will the repair of machine 2 be completed? How much time will machine 4 spend in the queue? Substantiate your answers. (9) [16] [BLAAI OM]
37 4 DSC3703 Oct/Nov 2011 Vraag 4 Parts arrive at a single workstation system according to an exponential interarrival distribution with mean 60 seconds; the first arrival is at time 0. Upon arrival, the parts are processed on a machine. The processing time is a random variable with triangular distribution TRIANG(18;19;22) seconds (that is a = 18;c = 19;b = 22). Assume that the model will be run for 1000 seconds. 4.1 Develop a simulation model for this system. (12) 4.2 Run your model until the first part leaves the system. You should sequentially use the U(0; 1) random numbers as given in Appendix A to generate random numbers from other distributions. Clearly define all variables used. (16) Vraag 5 [28] The following algorithm can be used to generate random numbers from a gamma distribution with parameters α (0;1) and β = 1. Apply it to generate one random number from a gamma distribution with α = 0,5 and β = 1. You may sequentially use the U(0; 1) random numbers given in Appendix A when necessary. Found:= false; b := (e + α)/e; {Comment: use e 2,718} while Found = false do Generate U 1 U(0,1) P := bu 1 if P > 1 then Y := ln[(b P)/α]; Generate U 2 U(0; 1); if U 2 Y (α 1) then Found = true; Return Y ; end if; else Y = P 1/α ; Generate U 2 U(0;1); if U 2 e Y then Found = true; Return Y ; end if end if end while (7) [7] TOTAAL: 80 c UNISA 2011
38 i DSC3703 Oct/Nov 2011 BYLAE A Formules en getalle Kansgetalle Die volgende ry van 20 kansgetalle is opeenvolgend uit n U[0;1)-verdeling gegenereer. U 1 = 0,56 U 9 = 0,15 U 17 = 0,81 U 25 = 0,69 U 33 = 0,78 U 2 = 0,31 U 10 = 0,09 U 18 = 0,63 U 26 = 0,68 U 34 = 0,92 U 3 = 0,67 U 11 = 0,40 U 19 = 0,87 U 27 = 0,60 U 35 = 0,19 U 4 = 0,80 U 12 = 0,78 U 20 = 0,46 U 28 = 0,20 U 36 = 0,56 U 5 = 0,97 U 13 = 0,15 U 21 = 0,96 U 29 = 0,26 U 37 = 0,86 U 6 = 0,73 U 14 = 0,04 U 22 = 0,92 U 30 = 0,71 U 38 = 0,73 U 7 = 0,15 U 15 = 0,58 U 23 = 0,80 U 31 = 0,13 U 39 = 0,42 U 8 = 0,51 U 16 = 0,13 U 24 = 0.33 U 32 = 0,92 U 40 = 0,54 Die chi-kwadraattoetswaarde χ 2 = k n k (f j n k )2 j=1 Persentielpunte van die chi-kwadraatverdeling Vryheidsgrade (d.f.) α ν 0,95 0,90 0,10 0,05 3 0,35 0,58 6,25 7,81 4 0,71 1,06 7,78 9,49 5 1,15 1,61 9,24 11,07 6 1,64 2,20 10,64 12,59 7 2,17 2,83 12,02 14,07 8 2,73 3,49 13,36 15,51 9 3,33 4,17 14,68 16, ,94 4,87 15,99 18,31 Die Kolmogorov-Smirnovtoetswaardes ,85 15,66 33,20 36,42 [ ] i D + = max 1 i n n F X(x (i) ) [ D = max F X (x (i) ) i ] 1 i n n D = max(d + ;D ) T = D( n + 0,12 + 0,11/ n) Persentielpunte vir T: Persentasie ,5 1 Kritieke waarde 1,138 1,224 1,358 1,480 1,628
39 ii DSC3703 Oct/Nov 2011 Kumulatieweverdelingsfunksies { 1 e (x/β) as x 0 Eksponensiaalverdeling: F(x) = 0 andersins { 1 e (x/β) α as x > 0 Weibull-verdeling: F(x) = 0 andersins 0 as x < a x a Uniforme verdeling: F(x) = b a as a x b 1 as x > b 0 as x < a (x a) 2 (b a)(c a) as a x c Driehoekige verdeling: F(x) = 1 (b x)2 (b a)(b c) as c < x b 1 as x > b Vertrouensintervalle en die t-verdeling n 100(1 α)%-vertrouensinterval vir E(X) word gegee deur waar X = n i=1 X ± t (α/2;n 1) S 2 X i n S 2 = n n (X i X) 2 i=1 n 1 Persentielpunte van die t-verdeling Sentralelimietstelling Vryheidsgrade (d.f.) α ν 0,1 0,05 0,025 0,01 1 3,078 6,314 12,706 31, ,886 2,920 4,303 6, ,638 2,353 3,182 4, ,533 2,132 2,776 3, ,476 2,015 2,571 3, ,440 1,943 2,447 3, ,415 1,895 2,365 2, ,397 1,860 2,306 2, ,383 1,833 2,262 2, ,281 1,645 1,960 2,326.. Die som van n onafhanklike en identies verdeelde kansveranderlikes, elk met n gemiddelde µ en eindige variansie σ 2, is benaderd normaal verdeel met gemiddelde nµ en variansie nσ 2....
40 -i- DSC3703 Oct/Nov 2011 Memorandum VRAAG A deterministic simulation model contains no random variables whereas a stochastic simulation model contains one or more random variables. A queuing system where entities arrive randomly or the service time is random is example of a real life system which requires development of a stochastic model for its description. (2) 1.2 The Chi-square goodness-of-fit and the Kolmogorov-Smirov goodness of fit tests are suitable to test the uniformity of random numbers. The runs-up and lag-j correlation tests are suitable for independence. (4) 1.3 We know that f is a pdf then f(x)dx = 1. Then we find (7) f(x)dx = 1 0 ax 3 dx = a/4 and hence a = 4. The cumulative distribution function of X is given by F(x) = x f(t)dt Then 0 if x < 0 F(x) = x 4 if 0 x 1 1 if x > 1 The following algorithm generates a random number from that distribution. Generate U U(0; 1) Return R = F 1 (U) = U 1/4. [13] VRAAG We have that Profit = Revenue - Total costs. There are two possible cases: If Q D, then Rupert sells all the Q papers and receives 7Q rands. He pays 4Q to buy the papers and looses 3(D-Q) for unsatisfied demand. If Q D, then Ruperts sells only D papers and receive 7D rands and he receives 2(Q D) from the returned papers (to the publishers). With the the order costs of 4Q rands, it is clear that in both cases the equation is satisfied. 2.2 It is given that D has a normal distribution with mean µ = 135,7 and standard deviation σ = 27,1. Then we can generate random numbers by using one of the appropriate algorithms (2) (6) Memorandum i Blaai om asseblief
41 -ii- DSC3703 Oct/Nov 2011 described in the study guide. The simplest is the following simplified convolution algorithm Generate U i U(0; 1), i = 1,...,36. Consider Z 1 = U U 12 6; Z 1 = U U 24 6; Consider X i = µ + σz i. Return D i = max([x i ],0), i = 1,2 Using the algorithm, we find Z 1 = 0,12;Z 2 = 0,68 and D 1 = 139;D 2 = The profits corresponding to these demands are R405 and R408 respectively 2.4 One can advise Rupert to choose the order quantity of 150 because it gives the highest mean profit. But the order quantity of 140 can also be considered for a small risk compared to 140. (2) (6) The 95% confidence interval for the profit (if Q = 160) is given by Mean profit ± t (0.025,9999) mean standard error and mean standard error = standard deviation = 106,75/100 = 1,0675. number of iteration Noting that t (0.025,9999) = 1,9602 we find the interval [334,71; 338,90] [16] VRAAG The three main events are: a break down (that is an arrival of a new machine), a departure (or completion of repair) from Technician 1 and a departure from Technician Because the life time of a machine is U(6,10) hours, then the first breakdown is expected at time t = (6 + 10)/2 = 8 hours. 3.3 The initial values of the given variables are: TM = 0, DT,DT1,DT2 can be taken to be any large number, WL = 0; SS1 = SS2 = We use the following algorithm to generate random numbers from U(a; b): Generate U U(0; 1) Return X = a + (b a)u For the breakdown times, we find (using random numbers U 1,...,U 5 ) X 1 = 8,24;X 2 = 7,24;X 3 = 8,68;X 4 = 9,20;X 5 = 9,88 (2) (2) (3) (9) and for services times using U 6,...,U 10 ), Y 1 = 2,46;Y 2 = 1,30;Y 3 = 2,02;Y 4 = 1,30;Y 5 = 1,18. Memorandum ii Blaai om asseblief
42 -iii- DSC3703 Oct/Nov 2011 Machine 2 will break down at time TM = 7,24 and its repair will start immediately and will be completed at TM = 7,24 + 1,30 = 8,54. Machine 1 will break down at TM = 8,24 and it repair will start immediately and end at TM = 8,24 + 2,46 = 10,70. Machine 3 will break down at time TM = 8,68 and there is a technician available to repair it. So its repair will be completed at TM = 8,68 + 2,02 = 10,70. Machine 4 will break down at T M = 9,20 while both technicians are busy. Its repair will only start at TM = 10,70 and will be completed at TM = 10,70 + 1,18 = 11,88. So the time Machine 4 will spend in the queue is 10,70 9,20 = 1,5. [16] VRAAG The following variables may be used: TM is the clock time of the simulation, AT is the scheduled time of the next arrival, DT is the scheduled time of the next procession completion, WL is the number of parts waiting in the processing queue, IT is the interarrival time, ST is the service time for procession, SS is the status of the procession machine (0 for idle and 1 for busy), MX length of the simulation run, The following algorithm can be used to model the system: {Initialisation} TM = 0; AT = 0; DT = 1000; WL = 0 ; SS = 0; MX = 1000 while TM MX do if AT DT then {process an arrival of a part} Set TM = AT if SS = 1 then {the procession machine is busy} WL = WL + 1; {join the queue} else {the procession machine is idle} SS = 1 {Seize the machine} {Generate a procession time} Generate ST TRIA(16,19,22) ; DT = TM + ST; {time to complete procession} end if; Generate IT EXPO(60) Set AT = TM + IT; else if AT > DT then {process a departure from procession} (12) Memorandum iii Blaai om asseblief
43 -iv- DSC3703 Oct/Nov 2011 Set TM = DT if WL > 0 then Update WL = WL 1; Generate ST T RIAN G(18,19,22); Set DT = TM + ST; else Set SS = 0; DT = 1000; end if; end if; end while; Print results and STOP. 4.2 To run the algorithm, proceed as follows : Iteration 1: We start with TM = 0 and TM MX is satisfied. The condition AT DT is also satisfied. We check the condition SS = 1, which is false. Set SS = 1 Then we generate a service time ST TRIA(16,19,22). {The following procedure can be used to generate random numbers from T RIA(a,c,b)}: Generate U U(0; 1) Set c = (c a)/(b a) if U c then X = c U else X = 1 (1 c )(1 U) end if; Return Y = a + (b a)x Now to find ST we take c = 0,5 and U = 0,56. Then U > c. Then X = 1 (1 c )(1 U) = 0,53 And Y = ,53 = 19,18 Then ST = 19,18; DT = TM + ST = 19,18 Generate IT EXPO(60). {The following procedure generates random numbers from EXPO(β):} Generate U U(0; 1) Return Y = β ln(1 U) Take U = 0,31 and return IT = 60 ln(1 0,31) = 22,26 Set AT = TM + IT = ,26 = 22,26. The first itreation is completed. Iteration 2: We have TM = 0, AT = 22,26;DT = 19,18; MX = 30,SS = 1 The condition TM MX is true. The condition AT > DT is true. (16) Memorandum iv Blaai om asseblief
44 -v- DSC3703 Oct/Nov 2011 {process a departure} The condition WL > 0 is false {the que is empty} Set SS = 0 and DT = The first part has left the system. STOP [28] VRAAG First consider b = (2, ,5)/(2,718) = 1,184 and U 1 = 0,56 Set P = b U 1 = 1,184 0,56 = 0,663 Since P > 1 is false, then Set Y = P 1/α = (0,663) 2 = 0,44. Generate U 2 = 0,31 e Y = 0,644 and hence U 2 e Y is true. Found = true (7) Return Return Y = 0,44. [7] TOTAAL: 80 Regmerke: 80 Antwoordpunte: 80 Memorandum v
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
EE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
More informationGeneration of Discrete Random variables
Simulation Simulation is the imitation of the operation of a realworld process or system over time. The act of simulating something first requires that a model be developed; this model represents the key
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationISyE 6644 Fall 2016 Test #1 Solutions
1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2
More informationSection 3.3: Discrete-Event Simulation Examples
Section 33: Discrete-Event Simulation Examples Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 33: Discrete-Event Simulation
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationVerification and Validation. CS1538: Introduction to Simulations
Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
More informationContinuous random variables
Continuous random variables Continuous r.v. s take an uncountably infinite number of possible values. Examples: Heights of people Weights of apples Diameters of bolts Life lengths of light-bulbs We cannot
More informationUniform random numbers generators
Uniform random numbers generators Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2707/ OUTLINE: The need for random numbers; Basic steps in generation; Uniformly
More informationNovember 2005 TYD/TIME: 90 min PUNTE / MARKS: 35 VAN/SURNAME: VOORNAME/FIRST NAMES: STUDENTENOMMER/STUDENT NUMBER: HANDTEKENING/SIGNATURE:
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPT WISKUNDE EN TOEGEPASTE WISKUNDE DEPT OF MATHEMATICS AND APPLIED MATHEMATICS WTW 263 - NUMERIESE METODES / NUMERICAL METHODS EKSAMEN / EXAMINATION
More information1.225J J (ESD 205) Transportation Flow Systems
1.225J J (ESD 25) Transportation Flow Systems Lecture 9 Simulation Models Prof. Ismail Chabini and Prof. Amedeo R. Odoni Lecture 9 Outline About this lecture: It is based on R16. Only material covered
More informationQualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama
Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours
More informationJUNE 2005 TYD/TIME: 90 min PUNTE / MARKS: 50 VAN/SURNAME: VOORNAME/FIRST NAMES: STUDENTENOMMER/STUDENT NUMBER:
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPT WISKUNDE EN TOEGEPASTE WISKUNDE DEPT OF MATHEMATICS AND APPLIED MATHEMATICS WTW 63 - NUMERIESE METHODE / NUMERICAL METHODS EKSAMEN / EXAMINATION
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 9 Verification and Validation of Simulation Models Purpose & Overview The goal of the validation process is: To produce a model that represents true
More information2905 Queueing Theory and Simulation PART IV: SIMULATION
2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random
More informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationVAN / SURNAME: VOORNAME / FIRST NAMES: STUDENTENOMMER / STUDENT NUMBER: FOONNO. GEDURENDE EKSAMENPERIODE / PHONE NO. DURING EXAM PERIOD:
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPT WISKUNDE EN TOEGEPASTE WISKUNDE DEPT OF MATHEMATICS AND APPLIED MATHEMATICS WTW 220 - ANALISE / ANALYSIS EKSAMEN / EXAM 12 November 2012 TYD/TIME:
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More information1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False:
1 st Midterm Exam Solution اس تعن ابهلل وكن عىل يقني بأ ن لك ما ورد يف هذه الورقة تعرفه جيدا وقد تدربت عليه مبا فيه الكفاية Student s Name Student s Number Question #1: Answer the following with True or
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationQueuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
More informationName of the Student:
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct
More informationHand Simulations. Christos Alexopoulos and Dave Goldsman 9/2/14. Georgia Institute of Technology, Atlanta, GA, USA 1 / 26
1 / 26 Hand Simulations Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 9/2/14 2 / 26 Outline 1 Monte Carlo Integration 2 Making Some π 3 Single-Server Queue 4
More informationYORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)
YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print)
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationTopic 4: Continuous random variables
Topic 4: Continuous random variables Course 3, 216 Page Continuous random variables Definition (Continuous random variable): An r.v. X has a continuous distribution if there exists a non-negative function
More informationTopic 4: Continuous random variables
Topic 4: Continuous random variables Course 003, 2018 Page 0 Continuous random variables Definition (Continuous random variable): An r.v. X has a continuous distribution if there exists a non-negative
More informationT. Liggett Mathematics 171 Final Exam June 8, 2011
T. Liggett Mathematics 171 Final Exam June 8, 2011 1. The continuous time renewal chain X t has state space S = {0, 1, 2,...} and transition rates (i.e., Q matrix) given by q(n, n 1) = δ n and q(0, n)
More informationSTAT515, Review Worksheet for Midterm 2 Spring 2019
STAT55, Review Worksheet for Midterm 2 Spring 29. During a week, the proportion of time X that a machine is down for maintenance or repair has the following probability density function: 2( x, x, f(x The
More informationON THE LAW OF THE i TH WAITING TIME INABUSYPERIODOFG/M/c QUEUES
Probability in the Engineering and Informational Sciences, 22, 2008, 75 80. Printed in the U.S.A. DOI: 10.1017/S0269964808000053 ON THE LAW OF THE i TH WAITING TIME INABUSYPERIODOFG/M/c QUEUES OPHER BARON
More informationISyE 2030 Practice Test 1
1 NAME ISyE 2030 Practice Test 1 Summer 2005 This test is open notes, open books. You have exactly 90 minutes. 1. Some Short-Answer Flow Questions (a) TRUE or FALSE? One of the primary reasons why theoretical
More informationHOëRSKOOL STRAND WISKUNDE NOVEMBER 2016 GRAAD 11 VRAESTEL 2
HOëRSKOOL STRAND WISKUNDE NOVEMBER 2016 TOTAAL: 150 Eksaminator: P. Olivier GRAAD 11 VRAESTEL 2 TYD: 3UUR Moderator: E. Loedolff INSTRUKSIES: 1. Hierdie vraestel bestaan uit 8 bladsye en n DIAGRAMBLAD
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationUNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA WTW263 NUMERIESE METODES WTW263 NUMERICAL METHODS EKSAMEN / EXAMINATION
VAN/SURNAME : UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA VOORNAME/FIRST NAMES : WTW26 NUMERIESE METODES WTW26 NUMERICAL METHODS EKSAMEN / EXAMINATION STUDENTENOMMER/STUDENT NUMBER : HANDTEKENING/SIGNATURE
More informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationSimulation. Where real stuff starts
Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3
More informationISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16)
1 NAME ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16) This test is 85 minutes. You are allowed two cheat sheets. Good luck! 1. Some short answer questions to get things going. (a) Consider the
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 29, 2014 Introduction Introduction The world of the model-builder
More information3 Continuous Random Variables
Jinguo Lian Math437 Notes January 15, 016 3 Continuous Random Variables Remember that discrete random variables can take only a countable number of possible values. On the other hand, a continuous random
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationSolution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.
Solutions Stochastic Processes and Simulation II, May 18, 217 Problem 1: Poisson Processes Let {N(t), t } be a homogeneous Poisson Process on (, ) with rate λ. Let {S i, i = 1, 2, } be the points of the
More informationLecturer: Olga Galinina
Renewal models Lecturer: Olga Galinina E-mail: olga.galinina@tut.fi Outline Reminder. Exponential models definition of renewal processes exponential interval distribution Erlang distribution hyperexponential
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationComputer Simulation Techniques: The definitive introduction!
Clients CPU Computer Simulation Techniques: The definitive introduction! 1 2 2 3 3 7 b 4 5 6 9 6 9 Yes Is CPU No MCL = tarr queue MCL = MCL + 1 empty? A new arrival event occurs A departure event occurs
More informationContinuous random variables
Continuous random variables Can take on an uncountably infinite number of values Any value within an interval over which the variable is definied has some probability of occuring This is different from
More informationISyE 3044 Fall 2015 Test #1 Solutions
1 NAME ISyE 3044 Fall 2015 Test #1 Solutions You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point for writing your
More informationWTW 263 NUMERIESE METODES / NUMERICAL METHODS
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA FAKULTEIT NATUUR- EN LANDBOUWETENSKAPPE / FACULTY OF NATURAL AND AGRICULTURAL SCIENCES DEPARTEMENT WISKUNDE EN TOEGEPASTE WISKUNDE DEPARTMENT OF MATHEMATICS
More informationSimulation & Modeling Event-Oriented Simulations
Simulation & Modeling Event-Oriented Simulations Outline Simulation modeling characteristics Concept of Time A DES Simulation (Computation) DES System = model + simulation execution Data Structures Program
More informationConstruction Operation Simulation
Construction Operation Simulation Lecture #8 Output analysis Amin Alvanchi, PhD Construction Engineering and Management Department of Civil Engineering, Sharif University of Technology Outline 2 Introduction
More informationISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16)
1 NAME ISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16) You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point
More informationUNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPT WISKUNDE EN TOEGEPASTE WISKUNDE DEPT OF MATHEMATICS AND APPLIED MATHEMATICS
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPT WISKUNDE EN TOEGEPASTE WISKUNDE DEPT OF MATHEMATICS AND APPLIED MATHEMATICS VAN/SURNAME: VOORNAME/FIRST NAMES: WTW 218 - CALCULUS SEMESTERTOETS /
More informationSlides 8: Statistical Models in Simulation
Slides 8: Statistical Models in Simulation Purpose and Overview The world the model-builder sees is probabilistic rather than deterministic: Some statistical model might well describe the variations. An
More informationEngineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 2262 MATERIAL NAME : University Questions MATERIAL CODE : SKMA104 UPDATED ON : May June 2013 Name of the Student: Branch: Unit I (Random Variables)
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More information[1a] 1, 3 [1b] 1, 0 [1c] 1, 3 en / and 1, 5 [1d] 1, 0 en / and 1, 0 [1e] Geen van hierdie / None of these
AFDELING A : MEERVOUDIGE KEUSE VRAE. 20 PUNTE Beantwoord vrae 1 tot 10 op die MERKLEESVORM se KANT 2. Indien kant 1 gebruik word sal dit nie nagesien word nie. Gebruik n sagte potlood. Jy mag nie verkeerde
More informationOutline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Outline Simulation of a Single-Server Queueing System Review of midterm # Department of Electrical and Computer Engineering
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationSection 1.2: A Single Server Queue
Section 12: A Single Server Queue Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 12: A Single Server Queue 1/ 30 Section
More informationSampling Random Variables
Sampling Random Variables Introduction Sampling a random variable X means generating a domain value x X in such a way that the probability of generating x is in accordance with p(x) (respectively, f(x)),
More informationQUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
More informationChapter 2 SIMULATION BASICS. 1. Chapter Overview. 2. Introduction
Chapter 2 SIMULATION BASICS 1. Chapter Overview This chapter has been written to introduce the topic of discreteevent simulation. To comprehend the material presented in this chapter, some background in
More informationSandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue
Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue Final project for ISYE 680: Queuing systems and Applications Hongtan Sun May 5, 05 Introduction As
More informationVAN/SURNAME: VOORNAME/FIRST NAMES: STUDENTENOMMER/STUDENT NUMBER: Totaal / Total:
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA DEPARTMENT OF MATHEMATICS AND APPLIED MATHEMATICS DEPARTEMENT WISKUNDE EN TOEGEPASTE WISKUNDE WTW 15 - WISKUNDIGE MODELLERING / MATHEMATICAL MODELLING
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationBatch Arrival Queuing Models with Periodic Review
Batch Arrival Queuing Models with Periodic Review R. Sivaraman Ph.D. Research Scholar in Mathematics Sri Satya Sai University of Technology and Medical Sciences Bhopal, Madhya Pradesh National Awardee
More informationChapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.
8. Preliminaries L, L Q, W, W Q L = average number of customers in the system. L Q = average number of customers waiting in queue. W = average number of time a customer spends in the system. W Q = average
More informationGRADE 9 - FINAL ROUND QUESTIONS GRAAD 9 - FINALE RONDTE VRAE
GRADE 9 - FINAL ROUND QUESTIONS - 009 GRAAD 9 - FINALE RONDTE VRAE - 009 QUESTION/ VRAAG Find the final value if an amount of R7500 is increased by 5% and then decreased by 0%. Bepaal die finale waarde
More informationSEMESTERTOETS 1 / SEMESTER TEST 1
UNIVERSITEIT VAN PRETORIA / UNIVERSITY OF PRETORIA FAKULTEIT NATUUR- EN LANDBOUWETENSKAPPE / FACULTY OF NATURAL AND AGRICULTURAL SCIENCES DEPARTEMENT WISKUNDE EN TOEGEPASTE WISKUNDE DEPARTMENT OF MATHEMATICS
More informationEEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture
More informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
More informationMATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM
MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM YOUR NAME: KEY: Answers in blue Show all your work. Answers out of the blue and without any supporting work may receive no credit even if they are
More informationIntroduction to Queuing Networks Solutions to Problem Sheet 3
Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;
More informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationA random variable is said to have a beta distribution with parameters (a, b) ifits probability density function is equal to
224 Chapter 5 Continuous Random Variables A random variable is said to have a beta distribution with parameters (a, b) ifits probability density function is equal to 1 B(a, b) xa 1 (1 x) b 1 x 1 and is
More informationNotes for Math 324, Part 19
48 Notes for Math 324, Part 9 Chapter 9 Multivariate distributions, covariance Often, we need to consider several random variables at the same time. We have a sample space S and r.v. s X, Y,..., which
More informationNATIONAL SENIOR CERTIFICATE NASIONALE SENIOR SERTIFIKAAT GRADE/GRAAD 12 JUNE/JUNIE 2018 MATHEMATICS P1/WISKUNDE V1 MARKING GUIDELINE/NASIENRIGLYN
NATIONAL SENIOR CERTIFICATE NASIONALE SENIOR SERTIFIKAAT GRADE/GRAAD JUNE/JUNIE 08 MATHEMATICS P/WISKUNDE V MARKING GUIDELINE/NASIENRIGLYN MARKS/PUNTE: 50 This marking guideline consists of 5 pages./ Hierdie
More informationWTW 158 : CALCULUS EKSAMEN / EXAMINATION Eksterne eksaminator / External examiner: Me/Ms R Möller
Outeursreg voorbehou UNIVERSITEIT VAN PRETORIA Departement Wiskunde en Toegepaste Wiskunde Copyright reserved UNIVERSITY OF PRETORIA Department of Mathematics and Applied Maths Junie / June 005 Maksimum
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationWTW 158 : CALCULUS EKSAMEN / EXAMINATION Eksterne eksaminator / External examiner: Prof NFJ van Rensburg
Outeursreg voorbehou UNIVERSITEIT VAN PRETORIA Departement Wiskunde en Toegepaste Wiskunde Copyright reserved UNIVERSITY OF PRETORIA Department of Mathematics and Applied Maths 4 Junie / June 00 Punte
More information7 Variance Reduction Techniques
7 Variance Reduction Techniques In a simulation study, we are interested in one or more performance measures for some stochastic model. For example, we want to determine the long-run average waiting time,
More informationRandom Number Generation. CS1538: Introduction to simulations
Random Number Generation CS1538: Introduction to simulations Random Numbers Stochastic simulations require random data True random data cannot come from an algorithm We must obtain it from some process
More informationEXAMINATION / EKSAMEN 17 JUNE/JUNIE 2011 AT / OM 12:00 Q1 Q2 Q3 Q4 Q5 Q6 TOTAL
UNIVERSITY OF PRETORIA / UNIVERSITEIT VAN PRETORIA FACULTY OF NATURAL AND AGRICULTURAL SCIENCES / FAKULTEIT NATUUR- EN LANDBOUWETENSKAPPE DEPARTMENT OF MATHEMATICS AND APPLIED MATHEMATICS / DEPARTEMENT
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 4 Statistical Models in Simulation Purpose & Overview The world the model-builder sees is probabilistic rather than deterministic. Some statistical model
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationλ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These
Queuing theory models systems with servers and clients (presumably waiting in queues). Notation: there are many standard symbols like λ, µ, ρ, A n, W n, L(t), L, L Q, w, w Q etc. These represent the actual
More informationRichard C. Larson. March 5, Photo courtesy of Johnathan Boeke.
ESD.86 Markov Processes and their Application to Queueing Richard C. Larson March 5, 2007 Photo courtesy of Johnathan Boeke. http://www.flickr.com/photos/boeke/134030512/ Outline Spatial Poisson Processes,
More informationStochastic Optimization
Chapter 27 Page 1 Stochastic Optimization Operations research has been particularly successful in two areas of decision analysis: (i) optimization of problems involving many variables when the outcome
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationClassification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More information