U. of Thessaly5th Int'l Conf. on Manuf. Syst.1 Analysis of a Bufferless, Paced, Automatic Transfer Line with Massive Scrapping of Material during Long.

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

Discrete Uniform Distribution
Statistics review of basic probability and statistics.
Operating Characteristics of Nozzles P M V Subbarao Professor Mechanical Engineering Department I I T Delhi From Takeoff to cruising …… Realizing New.
Buffered Data Processing Procedure Version of Comments MG / CCSDS Fall Meeting 2012 Recap on Previous Discussions Queue overflow processing.
Two-Stage Paced Lines Active Learning – Module 2 Dr. Cesar Malave Texas A & M University.
PRODUCTION SYSTEMS ENGINEERING Chapter 11: Analysis of Exponential Lines Instructors: J. Li (Univ. of Kentucky) and S. M. Meerkov (Univ. of Michigan) Teaching.
Introduction to Transfer Lines Active Learning – Module 1
Modeling Process Quality
Structural Reliability Analysis – Basics
Discrete Probability Distributions
Stats for Engineers Lecture 11. Acceptance Sampling Summary One stage plan: can use table to find number of samples and criterion Two stage plan: more.
Planning under Uncertainty
Binomial Random Variables. Binomial experiment A sequence of n trials (called Bernoulli trials), each of which results in either a “success” or a “failure”.
Chapter 6 Section 1 Introduction. Probability of an Event The probability of an event is a number that expresses the long run likelihood that an event.
#11 QUEUEING THEORY Systems Fall 2000 Instructor: Peter M. Hahn
Modeling and Analysis of Manufacturing Systems: Flow Lines Kimberly Murdoch MEAE MAMS Prof. E. Gutierrez-Miravete April 19, 2001.
Simulation Modeling and Analysis
Prof. Bart Selman Module Probability --- Part d)
1 Review of Probability Theory [Source: Stanford University]
Engineering Probability and Statistics - SE-205 -Chap 3 By S. O. Duffuaa.
1 Engineering Computation Part 5. 2 Some Concepts Previous to Probability RANDOM EXPERIMENT A random experiment or trial can be thought of as any activity.
Some standard univariate probability distributions
CHAPTER 6 Statistical Analysis of Experimental Data
Statistics and Probability Theory Prof. Dr. Michael Havbro Faber
Some standard univariate probability distributions
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
Class notes for ISE 201 San Jose State University
Some standard univariate probability distributions
1 2. Reliability measures Objectives: Learn how to quantify reliability of a system Understand and learn how to compute the following measures –Reliability.
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
Probability Distribution
Chapter 5 Several Discrete Distributions General Objectives: Discrete random variables are used in many practical applications. These random variables.
The Binomial Distribution
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 5.2.
1 Performance Evaluation of Computer Systems By Behzad Akbari Tarbiat Modares University Spring 2009 Introduction to Probabilities: Discrete Random Variables.
Discrete Distributions
Dr. Cesar Malave Texas A & M University
Engineering Statistics ECIV 2305 Chapter 3 DISCRETE PROBABILITY DISTRIBUTIONS  3.1 The Binomial Distribution  3.2 The Geometric Distribution  3.3 The.
Winter 2006EE384x1 Review of Probability Theory Review Session 1 EE384X.
Random Variables & Probability Distributions Outcomes of experiments are, in part, random E.g. Let X 7 be the gender of the 7 th randomly selected student.
The Negative Binomial Distribution An experiment is called a negative binomial experiment if it satisfies the following conditions: 1.The experiment of.
Basic Probability (Chapter 2, W.J.Decoursey, 2003) Objectives: -Define probability and its relationship to relative frequency of an event. -Learn the basic.
Random Variables. A random variable X is a real valued function defined on the sample space, X : S  R. The set { s  S : X ( s )  [ a, b ] is an event}.
Stochastic Models Lecture 2 Poisson Processes
ENGR 610 Applied Statistics Fall Week 3 Marshall University CITE Jack Smith.
Biostatistics Class 3 Discrete Probability Distributions 2/8/2000.
McGraw-Hill/IrwinCopyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 5 Discrete Random Variables.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Statistics Lesson: ST-5 The Binomial Distribution The Binomial Distribution Learning Outcome.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
Approximate Three-Stage Model: Active Learning – Module 3 Dr. Cesar Malave Texas A & M University.
Exam 2: Rules Section 2.1 Bring a cheat sheet. One page 2 sides. Bring a calculator. Bring your book to use the tables in the back.
Some Common Discrete Random Variables. Binomial Random Variables.
Bernoulli Processes. Stochastic Processes A stochastic process is a collection of random variables: –{X(t), t  T} t may be either discrete: –E.g., number.
Probability Distributions. Constructing a Probability Distribution Definition: Consists of the values a random variable can assume and the corresponding.
Parul Institute Of Technology Name Of Subject:-Electrical Machines Name Of Faculty:-(1) Suresh Sahoo (2) Yogendra Tiwari E&C 3 rd Sem. Prepaid By :- Sr.No.NameEnrolment.
Probability Distributions: a review
Random variables (r.v.) Random variable
Today (2/16/16) Learning objectives (Sections 5.1, 5.2, and 5.3):
III. More Discrete Probability Distributions
Further Topics on Random Variables: 1
Discrete Random Variables: Basics
Discrete Random Variables: Joint PMFs, Conditioning and Independence
Discrete Random Variables: Basics
Berlin Chen Department of Computer Science & Information Engineering
IE 360: Design and Control of Industrial Systems I
Discrete Random Variables: Basics
Applied Statistical and Optimization Models
Presentation transcript:

U. of Thessaly5th Int'l Conf. on Manuf. Syst.1 Analysis of a Bufferless, Paced, Automatic Transfer Line with Massive Scrapping of Material during Long Failures George Liberopoulos, George Kozanidis, Panagiotis Tsarouhas University of Thessaly, Greece

U. of Thessaly5th Int'l Conf. on Manuf. Syst.2 Outline Introduction Model description Model analysis –Case 1: Material has NO memory of damage during previous stoppages –Case 2: Material has memory of damage during previous stoppages Effect of parameters on performance Comparison with model in which workstation downtimes do not have memoryless distributions

U. of Thessaly5th Int'l Conf. on Manuf. Syst.3 Introduction Manufacturing Setting –Continuous or semi-continuous processing manufacturing –High-speed, paced transfer lines with NO buffers in between workstations Examples –metallurgical products –nonmetallic mineral products (e.g., ceramics, glass, and cement) –basic chemicals –food and beverage products –paper products

U. of Thessaly5th Int'l Conf. on Manuf. Syst.4 Introduction Motivation –When a failure occurs, the section of the line upstream of the failure stops. –This causes a gap in production downstream of the failure (loss of productivity). –The quality of the material that is trapped in the stopped section of the line deteriorates with time. –If the stoppage lasts long enough, the trapped material may have to be scrapped because its quality becomes unacceptable. –RESULT: (1) Havoc, (2) wasted material, and (3) an additional significant gap in production upstream of the failure (additional loss in productivity).

U. of Thessaly5th Int'l Conf. on Manuf. Syst.5 Introduction Our own experience: –In a pizza processing line, approximately half of the 10% drop in efficiency of the line was due to the gap in production caused by failures while the other half was due to the gap caused by scrapping of material during long failures (Liberopoulos & Tsarouhas, 2005). Many other real-life situations (material solidification, too much exposure to heat, humidity, acidity, etc.) The problem is important from a manufacturing systems practitioner’s point of view but has not been studied from a manufacturing systems engineering perspective.

U. of Thessaly5th Int'l Conf. on Manuf. Syst.6 Introduction Literature on transfer lines and scrapping –Okamura & Yamashina (1977), Shanthikumar & Tien (1983), Jafari & Shanthikumar (1987), Buzacott & Shanthikumar (1993), Altiok (1996), Dogan & Altiok (1998) Literature on transfer lines and scrap/rework –Pourbabai (1990), Yu & Bricker (1993), Gopalan & Kannan (1994), Helber (2000), Li (2004) In all of the above works, wherever scrapping is involved, it is assumed that when a failure occurs at a workstation, a single part – that which is on the workstation – is either always scrapped or scrapped with a given stationary probability, independently of the failure time.

U. of Thessaly5th Int'l Conf. on Manuf. Syst.7 Model description Assumptions –M workstations in series with NO buffers in between –Space and time are discretized –N i = Number of discrete positions of workstation i –Processing time at every position is 1 time unit (cycle) –Inexhaustible supply of raw parts upstream of the first workstation –Unlimited storage area for finished parts downstream of the last workstation –Uptime of workstation i geometrically distributed with mean 1/p i –Downtime of workstation i geometrically distributed with mean 1/r i

U. of Thessaly5th Int'l Conf. on Manuf. Syst.8 Model analysis Efficiency (availability) of workstation i in isolation Efficiency (availability) of workstation i in the system Operating time of workstation i geometrically distributed with mean Stoppage time of workstation i geometrically distributed with mean

U. of Thessaly5th Int'l Conf. on Manuf. Syst.9 Model analysis Case 1: Material with NO memory of damage during previous stoppages –R i = stoppage time of workstation i ~ Geom ( ) –n i = maximum allowable stoppage time of workstation i –q i = conditional probability that a part will not be scrapped from a particular position of workstation i, given that it has entered this position –l i = conditional expected time that a part spends in any position of workstation i, given that it has moved into this position

U. of Thessaly5th Int'l Conf. on Manuf. Syst.10 Model analysis –q i,j = conditional probability that a part will enter position j of workstation i, given that it has entered workstation i –l i,j = conditional expected time that a part spends in position j of workstation i, given that it has entered workstation i –L i = conditional expected flow time of a part at workstation i, given that it has entered this workstation –Q i = conditional probability that a part will move from workstation i to workstation i + 1, given that it has entered workstation i, i.e. yield of workstation i

U. of Thessaly5th Int'l Conf. on Manuf. Syst.11 Model analysis – = unconditional probability that a part will move from workstation i to workstation i + 1, given that it has entered the system Note: = yield of the entire line = line availability  line yield = line efficiency – = unconditional expected flow time of a part at workstation i – = total unconditional expected flow time of a part in the line

U. of Thessaly5th Int'l Conf. on Manuf. Syst.12 Model analysis –B i = average number of parts in workstation i –B TOT = average number of parts in the entire line

U. of Thessaly5th Int'l Conf. on Manuf. Syst.13 Model analysis Case 2: Material WITH memory of damage during previous stoppages –S i,j = cumulative time that workstation i is stopped from the moment that a part enters position 1 of workstation i until it exits position j of workstation i –Q: P{S i,j = k}=? A: For k =0, For k > 0, consider the event that in its trajectory from position 1 to position j, a part does not stop in m out of the j positions and stops in the remaining j – m positions, and that the cumulative time that the part is stopped is k, where k > 0. The probability of this event is

U. of Thessaly5th Int'l Conf. on Manuf. Syst.14 Model analysis is the probability that the part does not stop in m positions and stops in the remaining j – m positions (binomial). is the probability that the cumulative time until the (j – m)th resumption of operation of workstation i following a stoppage is equal to k (Pascal or negative binomial). To find P{S i,j = k}, add over all possible values of m:

U. of Thessaly5th Int'l Conf. on Manuf. Syst.15 Model analysis –Each time a part enters a new position j of workstation i, where j = 2, …, N i, its remaining maximum allowable standstill time is n i – S i,j-1 instead of n i, as was the situation in the NO memory case. –Conditional expected flow time of a part in position j of workstation i, given that the part has entered workstation i: –Yield of workstation i: –The rest of the expressions are the same as in the NO memory case.

U. of Thessaly5th Int'l Conf. on Manuf. Syst.16 Effect of parameters on performance Problem instance with M = 6 identical workstations with parameters: N i = 10, p i = 0.1, r i = 0.8, and n i = 10, i = 1,…, M. How do p i, r i, n i affect,, B TOT ?

U. of Thessaly5th Int'l Conf. on Manuf. Syst.17 Effect of parameters on performance

U. of Thessaly5th Int'l Conf. on Manuf. Syst.18 Effect of parameters on performance

U. of Thessaly5th Int'l Conf. on Manuf. Syst.19 Effect of parameters on performance

U. of Thessaly5th Int'l Conf. on Manuf. Syst.20 Effect of parameters on performance

U. of Thessaly5th Int'l Conf. on Manuf. Syst.21 Effect of parameters on performance Other observations: –,, and B TOT are higher in the NO memory case than in the memory case (there is less scrapping in the NO memory case). –The effects of system parameters on system performance are more intense for downstream workstations than for upstream workstations. –The effect of p i on system performance seems to be linear, whereas the effect of r i seems to be concave.

U. of Thessaly5th Int'l Conf. on Manuf. Syst.22 Comparison with modified model in which workstation downtimes do not have memoryless distributions Original model: –M = 6 identical workstations with parameters: N i = 30, p i = 1/1600, r i = 1/30, and n i = 10, 20, 40, 50, i = 1,…, M. E[downtime i ] = 30; Var[downtime i ] = 870 Modified model: –Same as original model except that the workstation downtimes are distributed as the sum of two iid geometrically distributed rv’s, each with mean 15 E[downtime i ] = 30; Var[downtime i ] = 420

U. of Thessaly5th Int'l Conf. on Manuf. Syst.23 nini Memory of damage Model & method B TOT 10 No Oa Os ± ± ± ± M ± ± ± ± Yes Oa Os ± ± ± ± M ± ± ± ± No Oa Os ± ± ± ± M ± ± ± ± Yes Oa Os ± ± ± ± M ± ± ± ± Comparison with modified model

U. of Thessaly5th Int'l Conf. on Manuf. Syst.24 nini Memory of damage Model & method B TOT 40 No Oa Os ± ± ± ± M ± ± ± ± Yes Oa Os ± ± ± ± M ± ± ± ± No Oa Os ± ± ± ± M ± ± ± ± Yes Oa Os ± ± ± ± M ± ± ± ± Comparison with modified model

U. of Thessaly5th Int'l Conf. on Manuf. Syst.25 Observations: –,, and B TOT are higher in the NO memory case than in the memory case for both the original and the modified models (there is less scrapping in the NO memory case). –As n i increases,,, and B TOT increase (there is less scrapping when the material can remain still for a longer period). –The workstation downtimes in the modified model have half the variance of the workstation downtimes in the original model. –When n i > E[downtime i ], there is less scrapping in the modified model. –When n i < E[downtime i ], there is more scrapping in the modified model. –The difference in performance between the original and the modified models is less than 6%. Comparison with modified model

U. of Thessaly5th Int'l Conf. on Manuf. Syst.26 Comparison with modified model nini E[downtime] P{scrapping} = P{downtime > n i }