Department 2 Power cut of A1 and A2

Size: px
Start display at page:

Download "Department 2 Power cut of A1 and A2"

Transcription

1 3.12. PROBLEMS Problems Problem 3.1 A production system manufactures products A and B. Each product consists of two parts: A1 and A2 for product A and B1 and B2 for product B. The processing of A and B require several technological steps. The departments where these steps are carried out are shown in Figure The number of each department indicates its order in the technological process. The Department 1 Blanking of A1 Department 2 Power cut of A1 and A2 Department 1 Blanking of A2 Department II Wet cut of B1 Parts A1 & A2 and B1 & B2 are Shipped offsite for heat treatment (This option takes about 48 hours, while the cycle time of the machines in all department is about 30 sec.) Department II Wet cut of B2 Department 3 Hard turn of A2 Department III Hard turn of B1 and B2 Department 3 Hard turn of A1 Department IV Assembly of B Department 4 Assembly of A Figure 3.37: Problem 3.1 material handling among the departments is carried out by carts, which are pushed by machine operators from one department to another. (a) Construct a structural model of this production system. (b) Describe the data that have to be collected to identify this model. (c) Describe which steps must be taken to collect these data. (d) Describe which steps must be taken to validate this model. Problem 3.2 The layout of a production system for an automotive ignition device is shown in Figure It consists of four main operations: Housing Subassembly, Valve Body Assembly, Injector Subassembly, and Injector Final Assembly. In addition, the system contains Shell Assembly, three Welding operations (L.H.W., U.H.W., and Weld), two Overmold operations (O.M.1 and

2 116 CHAPTER 3. MATHEMATICAL MODELING O.M.2), two Set Stroke operations (Stroke 1 and Stroke 2), one Leak Test operation (L.T.) and one High Potential operation (Hi Pot). Finally, the system includes five buffers positioned as shown in Figure 3.38 and conveyor buffering among all other operations. Construct a structural model for this system and simplify it to a serial line. L.T. L.H.W. U.H.W. O.M.1 O.M.2 Hi Pot Housing Sub. L.C./L.H./L.I.T. Injector Final Asm. Injector Sub. Valve Body Sub. S.V. Shell Asm. Stroke 1 Stroke 2 Weld L.V.B.S. L.N.M.S. Legend: L.C./L.H./L.I.T.=Load Coil/Load Housing/Load Inlet Tube L.N.M.S.=Load Non-Magnetic Shell L.H.W.=Lower Housing Weld L.T.=Leak Test L.V.B.S.=Load Valve Body Shell O.M.=Overmold S.V.=Stroke Verify U.H.W.=Upper Housing Weld Figure 3.38: Problem 3.2 Problem 3.3 Consider the production system of Figure 3.38 and its model as a serial line obtained in Problem 3.2. Assume that the first five machines are of interest and their parameters are as follows: The cycle time of each machine is 3 sec and the breakdown and repair rates are (in units of 1/min): λ (S.A) = , μ (S.A.) = 0.5; λ (H.S.) = , μ (H.S.) = ; λ (L.T.) = , μ (L.T.) = 0.5; λ (L.H.W.) = , μ (L.H.W.) = 0.5; λ (U.H.W.) = , μ (U.H.W.) = 1. Assume also that the buffers between these operations have the following capacities: buffer between S.A. and H.S. = 125; buffer between H.S. and L.T. = 500; buffer between L.T. and L.H.W. = 15; buffer between L.H.W. and U.H.W. = 15.

3 3.13. ANNOTATED BIBLIOGRAPHY 117 (a) Construct the Bernoulli model of this five-machine exponential serial line. (b) Using the Simulation function of the PSE Toolbox, investigate the accuracy of the Bernoulli model. Problem 3.4 A serial production line with five exponential machines is defined as follows: λ =[0.0025, , , , ] (in units of 1/min), μ =[0.025, , 0.025, , 0.05] (in units of 1/min), c =[1.0714, , , , 1] (in units of parts/min), N = [26, 10, 28, 30]. (a) Construct the Bernoulli model of this five-machine exponential serial line. (b) Using the Simulation function of the PSE Toolbox, investigate the accuracy of the Bernoulli model. Problem 3.5 The layout of a production system for an automotive ignition device is shown in Figure It consists of 15 operations, separated by bufferconveyors. Construct a structural model for this system and simplify it to a serial line. Op.2 Op.4 Op.8 Op.12 Op.14 Op.6 Op.10 Op.1 Op.3 Op.5 Op.7 Op.9 Op.11 Op.13 Op.15 Figure 3.39: Problem 3.5 Problem 3.6 The layout of an automotive camshaft production line is shown in Figure Construct a structural model for this system and simplify it into two parallel serial lines Annotated Bibliography Various aspects of production systems modeling can be found in [3.1] J.A. Buzacott and J.G. Shantikumar, Stochastic Models of Manufacturing Systems, Prentice Hall, Englewood Cliffs, NJ, 1993.

4 162 CHAPTER 4. ANALYSIS OF BERNOULLI LINES the accuracy of the estimates for all performance measures depends on the pattern of machine efficiency allocation, with the lowest accuracy taking place for the inverted bowl and oscillatory allocations. The serial lines under consideration possess the property of reversibility: if the flow of parts is reversed, the production rate remains the same, while the probability of blockage (respectively, starvation) of machine i in the original line becomes the probability of starvation (respectively, blockage) of machine M i + 1 in the reversed line. The serial lines under consideration possess the property of monotonicity: improving any machine efficiency or increasing any buffer capacity always leads to an increased production rate of the system. 4.6 Problems Problem 4.1 Consider a two-machine Bernoulli production line defined by the conventions of Subsection with N = 1 (i.e., machine m 1 serves as the buffer). (a) Draw the state transition diagram of the ergodic Markov chain that describes this system and determine its transition probabilities. (b) Calculate the stationary probability of each state of this Markov chain and derive the formula for the production rate of this system. (c) Assuming that p 1 = p 2 =: p, draw the graph of PR as a function of p [0.5, 0.99] and comment on the qualitative behavior of this graph. Problem 4.2 Consider again a two-machine Bernoulli production line defined by conventions (a)-(e) of Subsection (a) Assume p 1 =0.95 and p 2 =0.6. Calculate and plot PR, WIP, BL 1 and ST 2 as a function of N for N from 1 to 10. Based on these plots, determine the buffer capacity that is reasonable for this system. (b) Assume p 1 =0.6 and p 2 =0.95. Again calculate and plot PR, WIP, BL 1 and ST 2 as a function of N for N between 1 and 10. Will your choice of buffer capacity change? Problem 4.3 Consider a two-machine Bernoulli production line defined by conventions (a)-(e) of Subsection Assume that N = 5 and p 1 p 2 =0.81. (a) Under this constraint, find p 1 and p 2, which maximize PR. (You may use trial and error to accomplish this; alternatively, you may think a little bit, look at the expressions for the performance measure, make an educated guess and verify it by calculations.) (b) For these p 1 and p 2, calculate PR, WIP, BL 1 and ST 2. What can you say about qualitative features of WIP, BL 1 and ST 2?

5 4.6. PROBLEMS 163 (c) Interpret the results and formulate a conjecture concerning the optimal allocation of p i s. Problem 4.4 Consider a two-machine Bernoulli production line defined by conventions (a)-(e) of Subsection Suppose that each machine produces a good part with probability g i and a defective part with probability 1 g i, i =1, 2. Assume that quality control devices operate in such a manner that a defective part is removed from the system immediately after the machine that produced this part. (a) Derive expressions for the production rate of good parts and for WIP, BL 1 and ST 2 in this system. (b) Using any example you wish, check if the reversibility property still holds. Problem 4.5 Consider a two-machine Bernoulli production line defined by all but one of the conventions of Subsection Specifically, assume that instead of the blocked before service, the following convention is used: Machine m 1 is blocked during a time slot if it is up at the beginning of this time slot and the buffer is full at the end of the previous time slot (i.e., the blockage of m 1 is independent of the status of m 2 ). We refer to this convention as symmetric blocking since both starvation and blocking conventions are of the same nature - they are defined by the state of the buffer and the status of one machine only. Assume for simplicity that the machines are identical, i.e., p 1 = p 2 =: p. (a) Draw the state transition diagram of the ergodic Markov chain that describes this system and determine the transition probabilities. (b) Derive the expressions for the stationary probabilities of this Markov chain. (c) Plot these stationary probabilities for p = 0.95 and for p = 0.55, assuming that in both cases N = 5; compare the resulting graphs with those of Figure 4.4 and explain what are the differences and why they take place. (d) Derive formulas for PR, WIP, BL 1 and ST 2 as a function of p and N. (e) Plot PR, WIP, BL 1 and ST 2 as functions of N for N from 1 to 10 and p =0.9; compare the resulting graphs with those of Figure 4.6, Line 1, and explain what are the differences and why they take place. Problem 4.6 Consider again the two-machine production line with the symmetric blocking as defined in Problem 4.5. Repeat parts (a)-(e) of Problem 4.2, assuming that p 1 p 2 ; for the questions in which numerical values are required, assume that p 1 =0.9 and p 2 =0.7. Problem 4.7 Investigate if the reversibility property holds for two-machine Bernoulli lines with the symmetric blocking convention defined in Problem 4.5. Problem 4.8 Repeat Problem 4.3 for a two-machine Bernoulli line with the symmetric blocking convention defined in Problem 4.5. Problem 4.9 Consider a 5-machine Bernoulli production line defined by conventions (a)-(e) of Subsection

6 164 CHAPTER 4. ANALYSIS OF BERNOULLI LINES (a) Assume p i =0.9, i =1,...,5, and all buffers are of equal capacity. Calculate and plot PR, ŴIP, BL i and ŜT i as functions of N i for N i =1, 2, 3, 4, and 5. Based on these results, determine the buffer capacity, which is reasonable for this system. (b) Assume now that p i =0.7, i =1,...,5, and buffers are as above. Again calculate and plot PR, ŴIP, BL i and ŜT i as functions of N i. Will your choice of buffer capacity change? (c) Interpret the results. Formulate your conjecture as to the choice of buffer capacity as a function of machine efficiency. Problem 4.10 Consider a 3-machine Bernoulli production line defined by conventions (a)-(e) of Subsection Assume N i =1,i =1, 2, and p 1 p 2 p 3 = (0.8) 3. (a) Under this constraint, find p i, i =1, 2, 3, which maximize PR. (You may use the trial and error method and the PSE Toolbox to accomplish this.) (b) For these p i, calculate ŴIP, BL i and ŜT i. What can you say about ŴIP? Interpret the results and formulate a conjecture concerning the optimal allocation of p i s. Problem 4.11 Consider the production system of Figure 3.38 and its 5- machine Bernoulli model constructed in Problem 3.3. (a) Calculate the production rate of this system. (b) Calculate the average occupancy of each buffer. (c) Calculate the probabilities of blockages and starvations of all machines. (d) Assuming that the Bernoulli buffer capacity is increased by a factor of 2, recalculate the production rate. Does it make practical sense to have all buffer capacities increased? (e) Assume that efficiency of all Bernoulli machines is increased by 10% and again recalculate the production rate. Does it make sense to have all efficiencies increased? Problem 4.12 Repeat the steps of Problem 4.11 for the Bernoulli model of the production system constructed in Problem 3.4. Problem 4.13 Consider a seven-machine Bernoulli line with machines having identical efficiency. Assume that two buffers with equal capacities are available to be placed in this system. (a) Where should the buffers be placed so that PR is maximized? (b) Suggest an example illustrating the efficacy of your solution. Problem 4.14 Consider a ten-machine Bernoulli line with machines of identical efficiency and buffers of identical capacity. Assume that the efficiency of two machines can be increased (or new machines with higher efficiency can be purchased).

7 4.7. ANNOTATED BIBLIOGRAPHY 165 (a) Which of the machines should be improved (or replaced) so that PR is maximized? (b) Suggest an example illustrating the efficacy of your solution. Problem 4.15 Consider an M > 2-machine Bernoulli line with the symmetric blocking convention defined in Problem 4.5. (a) Develop a recursive aggregation procedure for performance analysis of this line. (b) Derive formulas for estimates of PR, ŴIP i, BL i and ŜT i. Problem 4.16 Using examples, investigate the reversibility property of M> 2-machine Bernoulli lines with the symmetric blocking convention. In particular, investigate if still hold and, in addition, PR L = PR Lr, (4.54) BL L i = ŜTL r (M i+1) r, i =1,...,M (4.55) (4.56) ŴIP L r i r = N M i ŴIP L M i. (4.57) Problem 4.17 Using examples, investigate the monotonicity property of M>2-machine Bernoulli lines with the symmetric blocking convention. 4.7 Annotated Bibliography The initial analysis of two-machine Bernoulli lines has been carried out in [4.1] J.-T. Lim, S.M. Meerkov and F. Top, Homogeneous, Asymtotically Reliable Serial Production Lines: Theory and a Case Study, IEEE Transactions on Automatic Control, vol. 35, pp , under the assumption that the machines are asymptotically reliable, i.e., their efficiencies are close to 1. The general case has been addressed in [4.2] D.A. Jacobs and S.M. Meerkov, A System-Theoretic Property of Serial Production Lines: Improvability, International Journal of System Science, vol. 26, pp , The case of M > 2-machine lines has also been analyzed in [4.1] for the asymptotically reliable machines and then generalized in [4.2]. Numerical investigation of aggregation procedure accuracy has been carried out by J. Huang and A. Khondker in the framework of their course project in

8 5.6. PROBLEMS 197 The buffering of a production line is potent if the BN-m is indeed the machine with the smallest efficiency. Identifying the BN-m can be used as a basis for Measurement-based Management of production systems. 5.6 Problems Problem 5.1 Consider a five-machine line with Bernoulli machines. Assume N 1 = N 4 =1,N 2 = N 3 = 3 and the product of all p i s of the machines is (0.9) 5. (a) Design an unimprovable (i.e., optimal) system with respect to WF. (b) Does the inverted bowl phenomenon take place? Explain why it does or does not. Problem 5.2 Consider the same system as in Problem 5.1. (a) Using WF-Continuous Improvement Procedure 5.1, obtain an unimprovable system. (b) Does it coincide with the one obtained in Problem 5.1? Explain why it does or does not. (c) Calculate PR of the design obtained and compare it with that ensured by the design of Problem 5.1. Problem 5.3 Consider again a five-machine production line where the sum of N i s is 8 and the product of p i s is (0.9) 5. (a) Design a system that is unimprovable with respect to both WF and BC simultaneously. (b) Compare it with the designs obtained in Problems 5.1 and 5.2 and comment on the differences in structures and production rates of each design. Problem 5.4 Consider a four-machine Bernoulli line, where the sum of N i s is 5. (a) Assume each p i is 0.8. Using BC-Continuous Improvement Procedure 5.1, find the unimprovable allocation of N i s. Comment on the shape of this allocation as a function of i. (b) Assume now that p 1 = p 3 =0.7and p 2 = p 4 =0.9. Again, using BC- Continuous Improvement Procedure 5.1, determine the unimprovable allocation of N i s and compare it with the one obtained in (a). Comment on the reason for the differences. Problem 5.5 Consider the Bernoulli model of the production system analyzed in Problem 3.3.

9 198 CHAPTER 5. IMPROVEMENT OF BERNOULLI LINES (a) Determine if this system is WF-improvable. If so, calculate the unimprovable work allocation and the resulting production rate. (b) Determine if this system is BC-improvable. If so, calculate the unimprovable buffer capacity allocation and the resulting production rate. (c) Calculate the simultaneously unimprovable WF and BC allocations and the resulting production rate. (d) Compare the production rates obtained among themselves and with that obtained in Problem 4.9 for the original system. (e) Which, if any, of the above improvement projects would you recommend for implementation? Problem 5.6 Consider the Bernoulli model constructed in Problem 3.4 and analyzed in Problem Repeat steps (a)-(e) of Problem 5.5. Problem 5.7 Consider a five-machine serial line with Bernoulli machines. Assume N i =2,i =1,...,4, and p i s are as follows: [0.9, 0.7, 0.9, 0.9, 0.7]. (1) Determine the BN-m and BN-b. (2) Change the buffer capacities around the BN-m so that the bottleneck moves to another machine. What is the new BN-m? Why did the bottleneck move? (3) What is the BN-m when all buffers are infinite? Problem 5.8 Consider the production system analyzed in Problem 5.5. (a) Identify its BN-m (or PBN-m) and BN-b and determine if the buffering is potent. (b) Based on this information, design the best, from your point of view, continuous improvement project that results in 10% increase of the production rate of the system (as compared with the original one). (c) Using the B-exp transformation of Chapter 3, return to the exponential description and formulate measures, which would have to be carried out in order to implement this continuous improvement project. Problem 5.9 Repeat steps (a)-(c) of Problem 5.8 for the system considered in Problem 5.6. Problem 5.10 Derive a WF-Improvability Indicator for Bernoulli lines with the symmetric blocking convention. Problem 5.11 Derive a BC-Improvability Indicator for Bernoulli lines with the symmetric blocking convention. Problem 5.12 Derive a Bottleneck Indicator for identifying BN-m and BNb in Bernoulli lines with the symmetric blocking convention.

Production variability in manufacturing systems: Bernoulli reliability case

Production variability in manufacturing systems: Bernoulli reliability case Annals of Operations Research 93 (2000) 299 324 299 Production variability in manufacturing systems: Bernoulli reliability case Jingshan Li and Semyon M. Meerkov Department of Electrical Engineering and

More information

Bottlenecks in Markovian Production Lines: A Systems Approach

Bottlenecks in Markovian Production Lines: A Systems Approach 352 IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 14, NO. 2, APRIL 1998 Bottlenecks in Markovian Production Lines: A Systems Approach S.-Y. Chiang, C.-T. Kuo, and S. M. Meerkov Abstract In this paper,

More information

PERFORMANCE ANALYSIS OF PRODUCTION SYSTEMS WITH REWORK LOOPS

PERFORMANCE ANALYSIS OF PRODUCTION SYSTEMS WITH REWORK LOOPS PERFORMANCE ANALYSIS OF PRODUCTION SYSTEMS WITH REWORK LOOPS Jingshan Li Enterprise Systems Laboratory General Motors Research & Development Center Mail Code 480-106-359 30500 Mound Road Warren, MI 48090-9055

More information

Single-part-type, multiple stage systems. Lecturer: Stanley B. Gershwin

Single-part-type, multiple stage systems. Lecturer: Stanley B. Gershwin Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin Flow Line... also known as a Production or Transfer Line. M 1 B 1 M 2 B 2 M 3 B 3 M 4 B 4 M 5 B 5 M 6 Machine Buffer Machines are

More information

Bu er capacity for accommodating machine downtime in serial production lines

Bu er capacity for accommodating machine downtime in serial production lines int. j. prod. res., 2002, vol. 40, no. 3, 601±624 Bu er capacity for accommodating machine downtime in serial production lines EMRE ENGINARLARy, JINGSHAN LIz, SEMYON M. MEERKOVy* and RACHEL Q. ZHANG This

More information

MODELING AND ANALYSIS OF SPLIT AND MERGE PRODUCTION SYSTEMS

MODELING AND ANALYSIS OF SPLIT AND MERGE PRODUCTION SYSTEMS University of Kentucky UKnowledge University of Kentucky Master's Theses Graduate School 008 MODELING AND ANALYSIS OF SPLIT AND MERGE PRODUCTION SYSTEMS Yang Liu University of Kentucky, yang.liu@uky.edu

More information

MIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines

MIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines 2.852 Manufacturing Systems Analysis 1/165 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lectures 6 9: Flow Lines Models That Can Be Analyzed Exactly Stanley B. Gershwin

More information

Cellular Production Lines with Asymptotically Reliable Bernoulli Machines: Lead Time Analysis and Control

Cellular Production Lines with Asymptotically Reliable Bernoulli Machines: Lead Time Analysis and Control Cellular Production Lines with Asymptotically Reliable Bernoulli Machines: Lead Time Analysis and Control Semyon M. Meerkov and Chao-Bo Yan Department of Electrical Engineering and Computer Science University

More information

ACHIEVING OPTIMAL DESIGN OF THE PRODUCTION LINE WITH OBTAINABLE RESOURCE CAPACITY. Miao-Sheng CHEN. Chun-Hsiung LAN

ACHIEVING OPTIMAL DESIGN OF THE PRODUCTION LINE WITH OBTAINABLE RESOURCE CAPACITY. Miao-Sheng CHEN. Chun-Hsiung LAN Yugoslav Journal of Operations Research 12 (2002), Number 2, 203-214 ACHIEVING OPTIMAL DESIGN OF THE PRODUCTION LINE WITH OBTAINABLE RESOURCE CAPACITY Miao-Sheng CHEN Graduate Institute of Management Nanhua

More information

MIT Manufacturing Systems Analysis Lectures 15 16: Assembly/Disassembly Systems

MIT Manufacturing Systems Analysis Lectures 15 16: Assembly/Disassembly Systems 2.852 Manufacturing Systems Analysis 1/41 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lectures 15 16: Assembly/Disassembly Systems Stanley B. Gershwin http://web.mit.edu/manuf-sys

More information

A Bernoulli Model of Selective Assembly Systems

A Bernoulli Model of Selective Assembly Systems Preprints of the 19th World Congress The International Federation of Automatic Control A Bernoulli Model of Selective Assembly Systems Feng Ju and Jingshan Li Department of Industrial and Systems Engineering,

More information

A Method for Sweet Point Operation of Re-entrant Lines

A Method for Sweet Point Operation of Re-entrant Lines A Method for Sweet Point Operation of Re-entrant Lines Semyon M. Meerkov, Chao-Bo Yan, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 4819-2122, USA (e-mail:

More information

Transient Performance Evaluation, Bottleneck Analysis and Control of Production Systems

Transient Performance Evaluation, Bottleneck Analysis and Control of Production Systems University of Connecticut DigitalCommons@UConn Doctoral Dissertations University of Connecticut Graduate School 4-19-2017 Transient Performance Evaluation, Bottleneck Analysis and Control of Production

More information

Operations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads

Operations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing

More information

SCHEDULING POLICIES IN MULTI-PRODUCT MANUFACTURING SYSTEMS WITH SEQUENCE-DEPENDENT SETUP TIMES

SCHEDULING POLICIES IN MULTI-PRODUCT MANUFACTURING SYSTEMS WITH SEQUENCE-DEPENDENT SETUP TIMES Proceedings of the 2011 Winter Simulation Conference S. Jain, R. R. Creasey, J. Himmelspach, K. P. White, and M. Fu, eds. SCHEDULING POLICIES IN MULTI-PRODUCT MANUFACTURING SYSTEMS WITH SEQUENCE-DEPENDENT

More information

MARKOV PROCESSES. Valerio Di Valerio

MARKOV PROCESSES. Valerio Di Valerio MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some

More information

MIT Manufacturing Systems Analysis Lectures 18 19

MIT Manufacturing Systems Analysis Lectures 18 19 MIT 2.852 Manufacturing Systems Analysis Lectures 18 19 Loops Stanley B. Gershwin Spring, 2007 Copyright c 2007 Stanley B. Gershwin. Problem Statement B 1 M 2 B 2 M 3 B 3 M 1 M 4 B 6 M 6 B 5 M 5 B 4 Finite

More information

LEAN BUFFERING IN SERIAL PRODUCTION LINES WITH BERNOULLI MACHINES

LEAN BUFFERING IN SERIAL PRODUCTION LINES WITH BERNOULLI MACHINES LEAN BUFFERING IN SERIAL PRODUCTION LINES WITH BERNOULLI MACHINES A. B. HU AND S. M. MEERKOV Received 8 February 26; Accepted 7 April 26 Lean buffering is the smallest buffer capacity necessary to ensure

More information

Inequality Comparisons and Traffic Smoothing in Multi-Stage ATM Multiplexers

Inequality Comparisons and Traffic Smoothing in Multi-Stage ATM Multiplexers IEEE Proceedings of the International Conference on Communications, 2000 Inequality Comparisons and raffic Smoothing in Multi-Stage AM Multiplexers Michael J. Neely MI -- LIDS mjneely@mit.edu Abstract

More information

On the static assignment to parallel servers

On the static assignment to parallel servers On the static assignment to parallel servers Ger Koole Vrije Universiteit Faculty of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The Netherlands Email: koole@cs.vu.nl, Url: www.cs.vu.nl/

More information

2. Transience and Recurrence

2. Transience and Recurrence Virtual Laboratories > 15. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 2. Transience and Recurrence The study of Markov chains, particularly the limiting behavior, depends critically on the random times

More information

0utline. 1. Tools from Operations Research. 2. Applications

0utline. 1. Tools from Operations Research. 2. Applications 0utline 1. Tools from Operations Research Little s Law (average values) Unreliable Machine(s) (operation dependent) Buffers (zero buffers & infinite buffers) M/M/1 Queue (effects of variation) 2. Applications

More information

On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels

On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels Jie Luo, Anthony Ephremides ECE Dept. Univ. of Maryland College Park, MD 20742

More information

21 Markov Decision Processes

21 Markov Decision Processes 2 Markov Decision Processes Chapter 6 introduced Markov chains and their analysis. Most of the chapter was devoted to discrete time Markov chains, i.e., Markov chains that are observed only at discrete

More information

QUALITY ANALYSIS IN FLEXIBLE MANUFACTURING SYSTEMS WITH BATCH PRODUCTIONS

QUALITY ANALYSIS IN FLEXIBLE MANUFACTURING SYSTEMS WITH BATCH PRODUCTIONS University of Kentucky UKnowledge University of Kentucky Doctoral Dissertations Graduate School 2010 QUALITY ANALYSIS IN FLEXIBLE MANUFACTURING SYSTEMS WITH BATCH PRODUCTIONS Junwen Wang University of

More information

Problem 04 Side by Side

Problem 04 Side by Side Problem 04 Side by Side Relationship (REL) Chart A number of factors other than material handling flow (cost) might be of primary concern in layout. A Relationship (REL) Chart represents M(M-1)/2 symmetric

More information

UNIVERSITY OF CALGARY. A Method for Stationary Analysis and Control during Transience in Multi-State Stochastic. Manufacturing Systems

UNIVERSITY OF CALGARY. A Method for Stationary Analysis and Control during Transience in Multi-State Stochastic. Manufacturing Systems UNIVERSITY OF CALGARY A Method for Stationary Analysis and Control during Transience in Multi-State Stochastic Manufacturing Systems by Alireza Fazlirad A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES

More information

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov

More information

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter

More information

PRODUCTVIVITY IMPROVEMENT MODEL OF AN UNRELIABLE THREE STATIONS AND A SINGLE BUFFER WITH CONTINUOUS MATERIAL FLOW

PRODUCTVIVITY IMPROVEMENT MODEL OF AN UNRELIABLE THREE STATIONS AND A SINGLE BUFFER WITH CONTINUOUS MATERIAL FLOW Vol. 3, No. 1, Fall, 2016, pp. 23-40 ISSN 2158-835X (print), 2158-8368 (online), All Rights Reserved PRODUCTVIVITY IMPROVEMENT MODEL OF AN UNRELIABLE THREE STATIONS AND A SINGLE BUFFER WITH CONTINUOUS

More information

MIT Manufacturing Systems Analysis Lecture 10 12

MIT Manufacturing Systems Analysis Lecture 10 12 2.852 Manufacturing Systems Analysis 1/91 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lecture 10 12 Transfer Lines Long Lines Stanley B. Gershwin http://web.mit.edu/manuf-sys

More information

Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K

Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Attahiru Sule Alfa Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg, Manitoba

More information

A Nonlinear Programming Approach For a Fuzzy queue with an unreliable server Dr.V. Ashok Kumar

A Nonlinear Programming Approach For a Fuzzy queue with an unreliable server Dr.V. Ashok Kumar The Bulletin of Society for Mathematical Services and Standards Online: 2012-06-04 ISSN: 2277-8020, Vol. 2, pp 44-56 doi:10.18052/www.scipress.com/bsmass.2.44 2012 SciPress Ltd., Switzerland A Nonlinear

More information

Statistical process control of the stochastic complexity of discrete processes

Statistical process control of the stochastic complexity of discrete processes UDC 59.84 59.876. S p e c i a l G u e s t I s s u e CDQM, Volume 8, umber, 5, pp. 55-6 COMMUICATIOS I DEPEDABILITY AD QUALITY MAAGEMET An International Journal Statistical process control of the stochastic

More information

9. Reliability theory

9. Reliability theory Material based on original slides by Tuomas Tirronen ELEC-C720 Modeling and analysis of communication networks Contents Introduction Structural system models Reliability of structures of independent repairable

More information

Recap. 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 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 information

An Application of Graph Theory in Markov Chains Reliability Analysis

An Application of Graph Theory in Markov Chains Reliability Analysis An Application of Graph Theory in Markov Chains Reliability Analysis Pavel SKALNY Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VSB Technical University of

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System 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 information

Markovian Modeling of Multiclass Deterministic Flow Lines with Random Arrivals: The Case of a Single-Channel

Markovian Modeling of Multiclass Deterministic Flow Lines with Random Arrivals: The Case of a Single-Channel 2015 IEEE International Conference on Automation Science and Engineering (CASE) Aug 24-28, 2015. Gothenburg, Sweden Markovian Modeling of Multiclass Deterministic Flow Lines with Random Arrivals: The Case

More information

CS 798: Homework Assignment 3 (Queueing Theory)

CS 798: Homework Assignment 3 (Queueing Theory) 1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of

More information

A Heterogeneous Two-Server Queueing System with Balking and Server Breakdowns

A Heterogeneous Two-Server Queueing System with Balking and Server Breakdowns The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 230 244 A Heterogeneous Two-Server Queueing

More information

A POMDP Framework for Cognitive MAC Based on Primary Feedback Exploitation

A POMDP Framework for Cognitive MAC Based on Primary Feedback Exploitation A POMDP Framework for Cognitive MAC Based on Primary Feedback Exploitation Karim G. Seddik and Amr A. El-Sherif 2 Electronics and Communications Engineering Department, American University in Cairo, New

More information

So in terms of conditional probability densities, we have by differentiating this relationship:

So in terms of conditional probability densities, we have by differentiating this relationship: Modeling with Finite State Markov Chains Tuesday, September 27, 2011 1:54 PM Homework 1 due Friday, September 30 at 2 PM. Office hours on 09/28: Only 11 AM-12 PM (not at 3 PM) Important side remark about

More information

1 Markov decision processes

1 Markov decision processes 2.997 Decision-Making in Large-Scale Systems February 4 MI, Spring 2004 Handout #1 Lecture Note 1 1 Markov decision processes In this class we will study discrete-time stochastic systems. We can describe

More information

57:022 Principles of Design II Final Exam Solutions - Spring 1997

57: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 information

Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE

Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 55, NO. 9, SEPTEMBER 2010 1987 Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE Abstract

More information

An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules

An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules Joc Cing Tay and Djoko Wibowo Intelligent Systems Lab Nanyang Technological University asjctay@ntuedusg Abstract As the Flexible

More information

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty

Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty Comparison between Interval and Fuzzy Load Flow Methods Considering Uncertainty T.Srinivasarao, 2 P.Mallikarajunarao Department of Electrical Engineering, College of Engineering (A), Andhra University,

More information

Name: Math 29 Probability. Practice Final Exam. 1. Show all work. You may receive partial credit for partially completed problems.

Name: Math 29 Probability. Practice Final Exam. 1. Show all work. You may receive partial credit for partially completed problems. Name: Math 29 Probability Practice Final Exam Instructions: 1. Show all work. You may receive partial credit for partially completed problems. 2. You may use calculators and a two-sided sheet of reference

More information

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t 2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition

More information

Preemptive Resume Priority Retrial Queue with. Two Classes of MAP Arrivals

Preemptive Resume Priority Retrial Queue with. Two Classes of MAP Arrivals Applied Mathematical Sciences, Vol. 7, 2013, no. 52, 2569-2589 HIKARI Ltd, www.m-hikari.com Preemptive Resume Priority Retrial Queue with Two Classes of MAP Arrivals M. Senthil Kumar 1, S. R. Chakravarthy

More information

Sample Spaces, Random Variables

Sample Spaces, Random Variables Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted

More information

Research Article Quality Evaluation in Flexible Manufacturing Systems: A Markovian Approach

Research Article Quality Evaluation in Flexible Manufacturing Systems: A Markovian Approach Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2007, Article ID 57128, 24 pages doi:10.1155/2007/57128 Research Article Quality Evaluation in Flexible Manufacturing Systems:

More information

On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers

On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers Ger Koole INRIA Sophia Antipolis B.P. 93, 06902 Sophia Antipolis Cedex France Mathematics of Operations Research 21:469

More information

Uncertainty Quantification in Performance Evaluation of Manufacturing Processes

Uncertainty Quantification in Performance Evaluation of Manufacturing Processes Uncertainty Quantification in Performance Evaluation of Manufacturing Processes Manufacturing Systems October 27, 2014 Saideep Nannapaneni, Sankaran Mahadevan Vanderbilt University, Nashville, TN Acknowledgement

More information

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

Glossary 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 information

Transient Analysis of Single Machine Production Line Dynamics

Transient Analysis of Single Machine Production Line Dynamics International Journal of Operations Research International Journal of Operations Research Vol. 11, No. 2, 040 050 (2014) Transient Analysis of Single Machine Production Line Dynamics Farhood Rismanchian

More information

A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks

A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South

More information

Stochastic Modeling and Analysis of Generalized Kanban Controlled Unsaturated finite capacitated Multi-Stage Production System

Stochastic Modeling and Analysis of Generalized Kanban Controlled Unsaturated finite capacitated Multi-Stage Production System Stochastic Modeling and Analysis of Generalized anban Controlled Unsaturated finite capacitated Multi-Stage Production System Mitnala Sreenivasa Rao 1 orada Viswanatha Sharma 2 1 Department of Mechanical

More information

Modeling, Validation and Control of Manufacturing Systems

Modeling, Validation and Control of Manufacturing Systems Modeling, Validation and Control of Manufacturing Systems E. Lefeber, R.A. van den Berg and J.E. Rooda Abstract In this paper we elaborate on the problem of supply chain control in semiconductor manufacturing.

More information

Reliability Analysis of an Anti-lock Braking System using Stochastic Petri Nets

Reliability Analysis of an Anti-lock Braking System using Stochastic Petri Nets Reliability Analysis of an Anti-lock Braking System using Stochastic Petri Nets Kshamta Jerath kjerath@eecs.wsu.edu Frederick T. Sheldon sheldon@eecs.wsu.edu School of Electrical Engineering and Computer

More information

9.4 Life Sensitivity for Stress Effects

9.4 Life Sensitivity for Stress Effects 9.4 Life Sensitivity for Stress Effects The fatigue crack growth life of structural components is significantly affected by the level of applied (repeating) stress and the initial crack size. This section

More information

Production Capacity Modeling of Alternative, Nonidentical, Flexible Machines

Production Capacity Modeling of Alternative, Nonidentical, Flexible Machines The International Journal of Flexible Manufacturing Systems, 14, 345 359, 2002 c 2002 Kluwer Academic Publishers Manufactured in The Netherlands Production Capacity Modeling of Alternative, Nonidentical,

More information

Lecture XI. Approximating the Invariant Distribution

Lecture XI. Approximating the Invariant Distribution Lecture XI Approximating the Invariant Distribution Gianluca Violante New York University Quantitative Macroeconomics G. Violante, Invariant Distribution p. 1 /24 SS Equilibrium in the Aiyagari model G.

More information

RLS filter approach for linear distributed canning industry optimization

RLS filter approach for linear distributed canning industry optimization RLS filter approach for linear distributed canning industry optimization Author Sternheim Misuraca, M. R. Degree in Electronics Engineering, University of Buenos Aires, Argentina Project Engineer, Sistemas

More information

Syllabus for BC Calculus

Syllabus for BC Calculus Syllabus for BC Calculus Course Overview My students enter BC Calculus form an Honors Precalculus course which is extremely rigorous and we have 90 minutes per day for 180 days, so our calculus course

More information

Expected Time Delay in Multi-Item Inventory Systems with Correlated Demands

Expected Time Delay in Multi-Item Inventory Systems with Correlated Demands Expected Time Delay in Multi-Item Inventory Systems with Correlated Demands Rachel Q. Zhang Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109 Received

More information

Stochastic Optimization for Undergraduate Computer Science Students

Stochastic Optimization for Undergraduate Computer Science Students Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline

More information

Readings: Finish Section 5.2

Readings: Finish Section 5.2 LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout

More information

Bandit models: a tutorial

Bandit models: a tutorial Gdt COS, December 3rd, 2015 Multi-Armed Bandit model: general setting K arms: for a {1,..., K}, (X a,t ) t N is a stochastic process. (unknown distributions) Bandit game: a each round t, an agent chooses

More information

Discrete Markov Chain. Theory and use

Discrete Markov Chain. Theory and use Discrete Markov Chain. Theory and use Andres Vallone PhD Student andres.vallone@predoc.uam.es 2016 Contents 1 Introduction 2 Concept and definition Examples Transitions Matrix Chains Classification 3 Empirical

More information

Performance Evaluation of Queuing Systems

Performance Evaluation of Queuing Systems Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems

More information

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a WHEN IS A MAP POISSON N.G.Bean, D.A.Green and P.G.Taylor Department of Applied Mathematics University of Adelaide Adelaide 55 Abstract In a recent paper, Olivier and Walrand (994) claimed that the departure

More information

stochnotes Page 1

stochnotes Page 1 stochnotes110308 Page 1 Kolmogorov forward and backward equations and Poisson process Monday, November 03, 2008 11:58 AM How can we apply the Kolmogorov equations to calculate various statistics of interest?

More information

VEHICULAR TRAFFIC FLOW MODELS

VEHICULAR TRAFFIC FLOW MODELS BBCR Group meeting Fri. 25 th Nov, 2011 VEHICULAR TRAFFIC FLOW MODELS AN OVERVIEW Khadige Abboud Outline Introduction VANETs Why we need to know traffic flow theories Traffic flow models Microscopic Macroscopic

More information

Markov chains. Randomness and Computation. Markov chains. Markov processes

Markov chains. Randomness and Computation. Markov chains. Markov processes Markov chains Randomness and Computation or, Randomized Algorithms Mary Cryan School of Informatics University of Edinburgh Definition (Definition 7) A discrete-time stochastic process on the state space

More information

GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS

GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an

More information

Iterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems

Iterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems Iterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems Student: Amanda Schaeffer Sponsor: Wilfred M. Greenlee December 6, 007. The Power Method and the Contraction Mapping Theorem

More information

Week 2: Defining Computation

Week 2: Defining Computation Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way

More information

MIT Manufacturing Systems Analysis Lecture 14-16

MIT Manufacturing Systems Analysis Lecture 14-16 MIT 2.852 Manufacturing Systems Analysis Lecture 14-16 Line Optimization Stanley B. Gershwin Spring, 2007 Copyright c 2007 Stanley B. Gershwin. Line Design Given a process, find the best set of machines

More information

Engage Education Foundation

Engage Education Foundation A Free Exam for 2006-15 VCE study design Engage Education Foundation Units 3 and 4 Maths Methods (CAS): Exam 2 Practice Exam Solutions Stop! Don t look at these solutions until you have attempted the exam.

More information

2 Theory. 2.1 State Space Representation S 2 S 1 S 3

2 Theory. 2.1 State Space Representation S 2 S 1 S 3 In the following sections we develop the theory, illustrate the technique by applying it to a sample system, and validate the results using the method of enumeration. Notations: A-state functional (acceptable)

More information

Discrete Random Variables

Discrete Random Variables Chapter 5 Discrete Random Variables Suppose that an experiment and a sample space are given. A random variable is a real-valued function of the outcome of the experiment. In other words, the random variable

More information

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management Sample Questions: Section I: Subjective Questions 1. What are the inputs required to plan a master production schedule? 2. What are the different operations schedule types based on time and applications?

More information

Stochastic Optimization

Stochastic 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 information

Random Walks A&T and F&S 3.1.2

Random Walks A&T and F&S 3.1.2 Random Walks A&T 110-123 and F&S 3.1.2 As we explained last time, it is very difficult to sample directly a general probability distribution. - If we sample from another distribution, the overlap will

More information

STAT 3128 HW # 4 Solutions Spring 2013 Instr. Sonin

STAT 3128 HW # 4 Solutions Spring 2013 Instr. Sonin STAT 28 HW 4 Solutions Spring 2 Instr. Sonin Due Wednesday, March 2 NAME (25 + 5 points) Show all work on problems! (5). p. [5] 58. Please read subsection 6.6, pp. 6 6. Change:...select components...to:

More information

Retrial queue for cloud systems with separated processing and storage units

Retrial queue for cloud systems with separated processing and storage units Retrial queue for cloud systems with separated processing and storage units Tuan Phung-Duc Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro-ku, Tokyo, Japan

More information

6 Markov Chain Monte Carlo (MCMC)

6 Markov Chain Monte Carlo (MCMC) 6 Markov Chain Monte Carlo (MCMC) The underlying idea in MCMC is to replace the iid samples of basic MC methods, with dependent samples from an ergodic Markov chain, whose limiting (stationary) distribution

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System 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 information

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS

A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,

More information

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 5, MAY

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 5, MAY IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 5, MAY 1998 631 Centralized and Decentralized Asynchronous Optimization of Stochastic Discrete-Event Systems Felisa J. Vázquez-Abad, Christos G. Cassandras,

More information

Dynamic resource sharing

Dynamic resource sharing J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus

More information

Reliability of fluid systems

Reliability of fluid systems EPJ Web of Conferences 114, 02057 (2016) DOI: 10.1051/ epjconf/ 2016114 02057 C Owned by the authors, published by EDP Sciences, 2016 Reliability of fluid systems Jaroslav Kopáek 1, Kamil Fojtášek 1,a

More information

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 "

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 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 information

A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS

A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS J. Anselmi 1, G. Casale 2, P. Cremonesi 1 1 Politecnico di Milano, Via Ponzio 34/5, I-20133 Milan, Italy 2 Neptuny

More information

IBV Series C Carbon Steel Inverted Bucket Vertical Steam Trap

IBV Series C Carbon Steel Inverted Bucket Vertical Steam Trap Local regulations may restrict the use of this product to below the conditions quoted. In the interests of development and improvement of the product, we reserve the right to change the specification without

More information

IBV Series Z Alloy Steel Inverted Bucket Vertical Steam Trap

IBV Series Z Alloy Steel Inverted Bucket Vertical Steam Trap Local regulations may restrict the use of this product to below the conditions quoted. In the interests of development and improvement of the product, we reserve the right to change the specification without

More information

Asymptotic properties of imprecise Markov chains

Asymptotic properties of imprecise Markov chains FACULTY OF ENGINEERING Asymptotic properties of imprecise Markov chains Filip Hermans Gert De Cooman SYSTeMS Ghent University 10 September 2009, München Imprecise Markov chain X 0 X 1 X 2 X 3 Every node

More information