PRODUCTION SYSTEMS ENGINEERING Chapter 11: Analysis of Exponential Lines Instructors: J. Li (Univ. of Kentucky) and S. M. Meerkov (Univ. of Michigan) Teaching.

Slides:



Advertisements
Similar presentations
SMA 6304/MIT2.853/MIT2.854 Manufacturing Systems Lecture 19-20: Single-part-type, multiple stage systems Lecturer: Stanley B. Gershwin
Advertisements

Multiple Regression Analysis
Part II – TIME SERIES ANALYSIS C3 Exponential Smoothing Methods © Angel A. Juan & Carles Serrat - UPC 2007/2008.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Periodograms Bartlett Windows Data Windowing Blackman-Tukey Resources:
Chapter 4 Functions of Random Variables Instructor: Prof. Wilson Tang CIVL 181 Modelling Systems with Uncertainties.
1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
IRT Equating Kolen & Brennan, IRT If data used fit the assumptions of the IRT model and good parameter estimates are obtained, we can estimate person.
Christopher Dougherty EC220 - Introduction to econometrics (review chapter) Slideshow: asymptotic properties of estimators: plims and consistency Original.
Two-Stage Paced Lines Active Learning – Module 2 Dr. Cesar Malave Texas A & M University.
10 Further Time Series OLS Issues Chapter 10 covered OLS properties for finite (small) sample time series data -If our Chapter 10 assumptions fail, we.
ASYMPTOTIC PROPERTIES OF ESTIMATORS: PLIMS AND CONSISTENCY
Ch 5.2: Series Solutions Near an Ordinary Point, Part I
Computational Biology, Part 17 Biochemical Kinetics I Robert F. Murphy Copyright  1996, All rights reserved.
MULTIPLE INTEGRALS MULTIPLE INTEGRALS Recall that it is usually difficult to evaluate single integrals directly from the definition of an integral.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
Performance analysis for high speed switches Lecture 6.
G. Cowan Lectures on Statistical Data Analysis 1 Statistical Data Analysis: Lecture 8 1Probability, Bayes’ theorem, random variables, pdfs 2Functions of.
Chapter Sampling Distributions and Hypothesis Testing.
July 3, Department of Computer and Information Science (IDA) Linköpings universitet, Sweden Minimal sufficient statistic.
1 TCOM 501: Networking Theory & Fundamentals Lecture 8 March 19, 2003 Prof. Yannis A. Korilis.
Maximum likelihood (ML)
WINTER 2012IE 368. FACILITY DESIGN AND OPERATIONS MANAGEMENT 1 IE 368: FACILITY DESIGN AND OPERATIONS MANAGEMENT Lecture Notes #3 Production System Design.
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
Business Statistics: Communicating with Numbers
12 Autocorrelation Serial Correlation exists when errors are correlated across periods -One source of serial correlation is misspecification of the model.
Christopher Dougherty EC220 - Introduction to econometrics (chapter 7) Slideshow: weighted least squares and logarithmic regressions Original citation:
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Statistical Methods For Engineers ChE 477 (UO Lab) Larry Baxter & Stan Harding Brigham Young University.
Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Dr. Cesar Malave Texas A & M University
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
1 As we have seen in section 4 conditional probability density functions are useful to update the information about an event based on the knowledge about.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Two Functions of Two Random.
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
APPLICATIONS OF DIFFERENTIATION 4. A polynomial behaves near infinity as its term of highest degree. The polynomial behaves like the polynomial Near infinity.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
10. Basic Regressions with Times Series Data 10.1 The Nature of Time Series Data 10.2 Examples of Time Series Regression Models 10.3 Finite Sample Properties.
© The McGraw-Hill Companies, 2005 TECHNOLOGICAL PROGRESS AND GROWTH: THE GENERAL SOLOW MODEL Chapter 5 – second lecture Introducing Advanced Macroeconomics:
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues.
An Efficient Sequential Design for Sensitivity Experiments Yubin Tian School of Science, Beijing Institute of Technology.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. All Rights Reserved. Section 7-1 Review and Preview.
3.4 The Components of the OLS Variances: Multicollinearity We see in (3.51) that the variance of B j hat depends on three factors: σ 2, SST j and R j 2.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Two Random Variables.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 07: BAYESIAN ESTIMATION (Cont.) Objectives:
Chapter 24 Sturm-Liouville problem Speaker: Lung-Sheng Chien Reference: [1] Veerle Ledoux, Study of Special Algorithms for solving Sturm-Liouville and.
Copyright © 2014 by McGraw-Hill Higher Education. All rights reserved. Essentials of Business Statistics: Communicating with Numbers By Sanjiv Jaggia and.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 4 Inverse, Exponential, and Logarithmic Functions Copyright © 2013, 2009, 2005 Pearson Education,
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
College Algebra & Trigonometry
Sampling and estimation Petter Mostad
1 Introduction to Statistics − Day 4 Glen Cowan Lecture 1 Probability Random variables, probability densities, etc. Lecture 2 Brief catalogue of probability.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 04: GAUSSIAN CLASSIFIERS Objectives: Whitening.
1 Chapter 7 Performance analysis of failure- prone production lines Learning objectives : Understanding the mathematical models of production lines Understanding.
1 HETEROSCEDASTICITY: WEIGHTED AND LOGARITHMIC REGRESSIONS This sequence presents two methods for dealing with the problem of heteroscedasticity. We will.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
G. Cowan Lectures on Statistical Data Analysis Lecture 9 page 1 Statistical Data Analysis: Lecture 9 1Probability, Bayes’ theorem 2Random variables and.
1 BINARY CHOICE MODELS: LOGIT ANALYSIS The linear probability model may make the nonsense predictions that an event will occur with probability greater.
Parametric Methods Berlin Chen, 2005 References:
Learning From Observed Data
11. Conditional Density Functions and Conditional Expected Values
Laplace Transforms Lecture-11 Additional chapters of mathematics
11. Conditional Density Functions and Conditional Expected Values
Presentation transcript:

PRODUCTION SYSTEMS ENGINEERING Chapter 11: Analysis of Exponential Lines Instructors: J. Li (Univ. of Kentucky) and S. M. Meerkov (Univ. of Michigan) Teaching Assistant: L. Zhang (Univ. of Michigan) Copyright © 2008 J. Li, S.M. Meerkov and L. Zhang Tsinghua University

11-2 Motivation: The need for a quick and easy method for calculating PR, TP, WIP i, BL i, ST i in production lines with exponential machines. Analysis of the effects of T up and T down on the performance measures. The approach is the same as in the Bernoulli case: direct analysis of two-machine lines and recursive aggregations for M > 2-machine systems. The technicalities, however, are more involved.

1. Synchronous Exponential Lines Two machine case Conventions a)Blocked before service. b)The first machine is never starved; the last machine is never blocked. c)Flow model. d)Machine states are determined independently from each other. e)Time-dependent failures.

State of the system Triple (h, s 1, s 2 ): h [0, N], s i {up = 1, down = 0} Boundary states: (0, s 1, s 2 ) and (N, s 1, s 2 ) Internal states: (h, s 1, s 2 ), h (0, N)

States pdf Boundary states: Internal states: Clearly, This pdf is calculated using methods of continuous time, mixed space Markov process.

1.1.4 Stationary probabilities of the boundary states Here 11-6

1.1.4 Stationary probabilities of the boundary states (cont.) Lemma: Function Q(λ 1, μ 1, λ 2, μ 2 ) with λ 1 (0, ∞) μ 1 (0, ∞), and N (0, ∞), takes values on (0, 1) and is strictly decreasing in λ 2 and μ 1, strictly increasing in λ 1 and μ 2, strictly decreasing in N. 11-7

1.1.5 Stationary marginal pdf of buffer occupancy 11-8

Illustration: Lines with identical e i ’s: Stationary marginal pdf of buffer occupancy (cont.)

Reversed lines with identical e i ’s: 11-10

1.1.5 Stationary marginal pdf of buffer occupancy (cont.) Reversed lines with non-identical e i ’s: 11-11

1.1.6 Formulas for performance measures Production rate 11-12

1.1.6 Formulas for performance measures (cont.) Work-in-process where

1.1.6 Formulas for performance measures (cont.) Blockages and starvations i.e., (Recall that for Bernoulli lines, PR = p 1 – BL 1 = p 2 – ST 2.)

1.1.7 Effects of up- and downtime Theorem: Consider lines l 1 and l 2, with machines of identical efficiency and finite buffers of identical capacity. Assume Then, This phenomenon is due to the fact that finite buffers accommodate shorter downtime easier than longer ones 11-15

1.1.7 Effect of up- and downtime (cont.) Note that for an isolated machine, increasing T up by any factor or decreasing T down by the same factor has the same effect: The situation is different for serial lines: Theorem: In synchronous exponential two-machine lines defined by assumptions (a)-(e), PR has a larger increase when the downtime of a machine is decreased by a factor (1 + α), α > 0, than when the uptime is increased by the same factor

1.1.8 Asymptotic properties Theorem: 11-17

1.1.8 Asymptotic properties (cont.) Illustration (for the six lines used in the illustration of pdf’s) 11-18

1.2 M > 2-machine case Mathematical description and aggregation preliminaries Conventions: The same as in two-machine case. States: Too complex – aggregation is used for simplification

1.2.1 Mathematical description and aggregation preliminaries (cont.) Backward aggregation 11-20

1.2.1 Mathematical description and aggregation preliminaries (cont.) Forward aggregation 11-21

1.2.2 Aggregation equations with initial conditions: and boundary conditions: 11-22

1.2.2 Aggregation equations (cont.) Convergence Theorem: All four sequences are convergent: Moreover, i.e.,

1.2.2 Aggregation equations (cont.) Interpretation of the limits: i = 2,…, M – 1

1.2.3 Formulas for performance measures Production rate: Work-in-process 11-25

1.2.3 Formulas for performance measures (cont.) Blockages and starvations: 11-26

1.2.4 PSE Toolbox 11-27

1.2.5 Effects of up- and downtime Remain the same as in two-machine exponential lines: Shorter up- and downtime lead to larger than longer ones, even if the machine efficiencies remain the same. Decreasing T down by any factor leads to a larger than increasing T up by the same factor

1.2.6 Asymptotic properties 11-29

1.2.6 Asymptotic properties (cont.) Illustration (Line 1) 11-30

1.2.7 Accuracy of estimates is typically evaluated with the error within 1%. and have lower accuracy

1.2.8 System-theoretic properties Theorem: Synchronous exponential lines are reversible: Theorem: is strictly monotonically increasing in μ i, i = 1,…, M, and N i, i = 1,…, M – 1; strictly monotonically decreasing in λ i, i = 1,…, M

2. Asynchronous Exponential Lines 2.1 Two-machine case c i [parts/min], λ i [1/min], μ i [1/min] TP [parts/min]

2.1.1 Mathematical description Conventions (a)-(e) are assumed to hold. States are the same as in synchronous lines. Analysis is based on continuous time, mixed space Markov processes. Calculations are a little more involved than in the synchronous case. Function Q does not emerge in these calculations

2.1.2 Stationary marginal pdf of buffer occupancy where

2.1.2 Stationary marginal pdf of buffer occupancy (cont.) 11-36

2.1.2 Stationary marginal pdf of buffer occupancy (cont.) 11-37

2.1.2 Stationary marginal pdf of buffer occupancy (cont.) Illustration 11-38

2.1.2 Stationary marginal pdf of buffer occupancy (cont.) 11-39

2.1.2 Stationary marginal pdf of buffer occupancy (cont.) Observations remain the same as in the synchronous case: Reversibility holds. Larger up- and downtime qualitatively change pdf’s as compared with shorter ones

2.1.3 Formulas for performance measures Throughput:

2.1.3 Formulas for performance measures (cont.) Work-in-process 11-42

2.1.3 Formulas for performance measures (cont.) Blockages and starvations Represent Denote Then 11-43

2.1.3 Formulas for performance measures (cont.) Using conditional probability formula 11-44

2.1.3 Formulas for performance measures (cont.) Similar arguments are used to calculate BL

2.1.4 Effects of up- and downtime Similar to those in the synchronous case: Larger up- and downtime lead to lower TP than shorter ones. It is more efficient to decrease T down than to increase T up.

2.1.5 Asymptotic properties 11-47

2.1.5 Asymptotic properties (cont.) 11-48

2.1.5 Asymptotic properties (cont.) Observations remain the same as in the synchronous case: WIP may grow almost linearly in N, while TP is always saturating; thus, large N's are not advisable (see Chapter 14). Reverse lines have identical TP. Longer up- and downtime result in lower TP than shorter up- and downtime; in some cases, the difference is as large as 25%

2.2 M > 2-machine case Approach: Aggregation procedure based on c i, bl i, and st i

2.2.1 Aggregation equations with initial conditions and boundary conditions

2.2.1 Aggregation equations (cont.) Convergence Theorem: The aggregation procedure is convergent: In addition,

2.2.1 Aggregation equations (cont.) Interpretation of and i = 2,…, M – 1

2.2.2 Formulas for performance measures Throughput or use the formulas for two-machine lines with and. Work-in-process For, use the two-machine formulas with and. Blockages and starvations

2.2.3 PSE Toolbox 11-55

2.2.4 Effects of up- and downtime Remain the same as in synchronous lines

2.2.5 Asymptotic properties → min{c i e i } → 0 → c M e M – 11-57

2.2.5 Asymptotic properties (cont.) Illustration 11-58

2.2.5 Asymptotic properties (cont.) 11-59

2.2.6 Accuracy of the estimates Lower than that for synchronous lines. ε TP is on the average within 5%. ε WIP is on the average within 8%. ε ST i and ε BL i is on the average within

3. Case Studies 3.1 Automotive ignition coil processing system To account for the closed nature of the line, e 1 and T down, 1 have been modified to and 19.12, respectively

3.1.1 Model validation 11-62

3.1.2 Effect of starvation by pallets Observation: No significant TP improvement if the closed line is unimpeding

3.1.3 Effect of increased buffer capacity and m 9-10 efficiency Observation: Substantial improvement (similar to that obtained using the Bernoulli description) 11-64

3.2 Crankshaft production line (evaluation of the initial description) Layout

3.2.2 Structural model 11-66

3.2.3 Machine and buffer parameters 11-67

3.2.4 Performance and “what if” analysis Sensitivity to buffer capacity Sensitivity to Sta. 7 efficiency Observation: Although the initial design meets specification, Sta. 7’s performance should be given a particular attention in order to maintain the production goal

4. Summary The performance measures of serial lines with exponential machines can be evaluated using the same approach as in the Bernoulli case. Specifically, two-machines lines can be evaluated by closed-form expressions, and aggregation procedures can be used to analyze longer lines. However, all analytical expressions are more involved, especially in the asynchronous case. Stationary marginal pdf's of buffer occupancy contain δ- functions, which account for buffers being empty and full. The accuracy of the resulting performance measure estimates in the synchronous case is similar to that of the Bernoulli case. In the asynchronous case, the accuracy is lower

Shorter up- and downtime lead to a higher production rate (or throughput) than longer ones, even if machine efficiency remains constant. A decrease of the downtime leads to higher throughput of a serial line than an equivalent increase of the uptime. Exponential lines observe the usual monotonicity and reversibility properties Summary (cont.)