Upload
mohamed-mansour
View
231
Download
0
Embed Size (px)
Citation preview
8/12/2019 Tutorial Lecture4
1/52
Production Systems Engineering for
Factory Floor Management
Lecture 4: BOTTLENECK IDENTIFICATION
AND ELIMINATION
Semyon M. Meerkov, University of Michigan
Jingshan Li, University of Wisconsin Madison
Liang Zhang, University of Wisconsin Milwaukee
Copyright J. Li, S.M. Meerkov and L. Zhang 2012
8/12/2019 Tutorial Lecture4
2/52
Outline4.1. Introduction
4.2. What is the bottleneck machine?
4.3. What is the bottleneck buffer?
4.4. Identification of BN-m and BN-b in serial lines4.5. Identification of BN-m and BN-b in assembly systems
4.6. Potency of buffering
4.7. Designing continuous improvement projects
4.8. Measurement-based management
4.9. Case studies4.10. Summary
4.11. Lab: PSE Toolboxfunction for BN-m and BN-b identification
4-2
8/12/2019 Tutorial Lecture4
3/52
Due to breakdowns and other perturbations, it is not
uncommon that machining lines operate at 60%-70% of their
capacity.
In assembly systems, these numbers are 80%-90%.
Therefore, continuous improvement is of central importance.
4.1. Introduction
4-3
8/12/2019 Tutorial Lecture4
4/52
In practice, continuous improvement projects (i.e., improving
machines and buffers or purchasing new ones) are often
designed without a rigorous justification. As a result, many
continuous improvement projects do not measure up toexpectations.
The goal of this lecture is to present quantitative engineering
methods for designing continuous improvement projects with
rigorously predicted results.
The approach developed here is based on identification and
elimination of bottleneck machines and bottleneck buffers.
4-4
8/12/2019 Tutorial Lecture4
5/52
4.2. What is the Bottleneck Machine?
Often, the worst machine is isolation is viewed as the bottleneck
machine.
This understanding is wrong because it is localin nature anddoes not look at the system as a whole.
We define the bottleneck as the machine that affects the overall
system performance in the strongest manner.
To quantify this understanding, we introduce the followingdefinition:
4-5
8/12/2019 Tutorial Lecture4
6/52
Definition:
mi, i{1,,M}, is the bottleneck machine(BN-m) in a
Bernoulli line if
mi, i{1,,M}, is the c-bottleneck(c-BN) in a
line with continuous time models of machine reliability if
for all ;i j
PR PRj i
p p
>
for all .i j
TP TPj i
c c
>
i
i
j
j
4-6
8/12/2019 Tutorial Lecture4
7/524-7
8/12/2019 Tutorial Lecture4
8/52
(c) Machine with the smallest capacity is not the c-bottleneck
4-8
8/12/2019 Tutorial Lecture4
9/52
cannot be measured on the factory floor
during normal system operation.
Also, they cannot be evaluated analytically.
So, how the BN-m can be identified?
ori i
PR TP
p c
4-9
8/12/2019 Tutorial Lecture4
10/52
4.3. What is the Bottleneck Buffer?
Definition:bi, i{1,,M 1}, is the bottleneck buffer(BN-b)
if
The smallest buffer is not necessarily BN-b:
How the BN-b can be identified?
4-10
8/12/2019 Tutorial Lecture4
11/52
4.4. Identification of BN-m and BN-b in Serial Lines
It turns out that BN-m (or c-BN) and BN-b can be identified using
blockages and starvations of the machines.
Specifically, consider a production line and determine (either by
measurements on the factory floor or by calculations) the probabilities(or frequencies) of blockage and starvation of each machine.
PlaceBLiand STiunder each machine as follows:
STi 0 0.01 0.39 0.37 0.27
BLi 0.41 0.20 0.27 0.01 0
4-11
8/12/2019 Tutorial Lecture4
12/52
Assign arrows from one machine to another according to the
following rule: IfBLi>STi+1, assign the arrow pointing from mito
mi+1
. IfBLi
8/12/2019 Tutorial Lecture4
13/52
Bottleneck Indicator:
The machine with no emanating arrows is the BN-m (or c-BN).
If there are multiple machines with no emanating arrows, the one with
the largest severity is the Primary BN-m (Pc-BN), where the severityof each local bottleneck is defined as follows:
BN-b is one of the buffer surrounding the BN-m (or c-BN); it is before
BN-m if STi>BLi; it is after BN-m if STi
8/12/2019 Tutorial Lecture4
14/52
4-14
8/12/2019 Tutorial Lecture4
15/52
4-15
8/12/2019 Tutorial Lecture4
16/52
4-16
8/12/2019 Tutorial Lecture4
17/52
4-17
8/12/2019 Tutorial Lecture4
18/52
4-18
8/12/2019 Tutorial Lecture4
19/52
4.5. Identification of BN-m and BN-b in Assembly Systems
The definitions for BN-m and BN-b remain the same.
The arrow assignment rule also remains the same, with the only
difference that the merge operation may be starved by multiplecomponent lines.
Given this arrow assignment, the Bottleneck Indicator remains the
same as in serial lines.
4-19
8/12/2019 Tutorial Lecture4
20/52
4-20
8/12/2019 Tutorial Lecture4
21/52
4-21
8/12/2019 Tutorial Lecture4
22/52
4-22
8/12/2019 Tutorial Lecture4
23/52
4-23
8/12/2019 Tutorial Lecture4
24/52
4-24
8/12/2019 Tutorial Lecture4
25/52
4-25
8/12/2019 Tutorial Lecture4
26/52
4.6. Potency of Buffering
Definition:The buffering of a production system is:
weakly potentif the BN-m is the worst machine in the
system (i.e., the machine with the smallest throughput in
isolation); otherwise, it is not potent;
potentif it is weakly potent and its production rate is
sufficiently close to the BN-m efficiency (e.g., within 5% of
the BN machine efficiency);
strongly potentif it is potent and the total buffer capacity is
the smallest possible to ensure the desired throughput).
4-26
8/12/2019 Tutorial Lecture4
27/52
To determine if the buffering is weakly potent, the methods
introduced in this lecture may be used.
To determine if it is potent, the methods introduced in Lecture3 may be used.
To determine if it is strongly potent, the methods introduced in
Lecture 5 may be used.
4-27
8/12/2019 Tutorial Lecture4
28/52
Along with its practical utility, the notion of buffering potencyis important conceptually.
Indeed, typically, production supervisors concentrate theirattention on the machines their reliability, efficiency,capacity, etc.
Attention to buffering is often missing, although the buffersare also important for system operation.
The notion of buffering potency provides a language necessaryto focus attention on the buffers.
4-28
8/12/2019 Tutorial Lecture4
29/52
4-29
4.7. Designing Continuous Improvement Projects
8/12/2019 Tutorial Lecture4
30/52
4.8. Measurement-Based Management
The process of continuous improvement requires a
mathematical model of the system at hand.
This may be difficult to obtain (especially for large systems).Therefore, a simpler method, referred to as MBM, is proposed.
It consists of the steps described next.
4-30
8/12/2019 Tutorial Lecture4
31/52
4-31
8/12/2019 Tutorial Lecture4
32/52
Examples of the first step can be given as follows:
4-32
8/12/2019 Tutorial Lecture4
33/52
The second step can be carried out based on measuring the
blockages and starvations and using the expressions:
Thus, to carry out MBM, the manager must receive daily, or
weekly information of the time of blockages and starvation of
various units.
4-33
8/12/2019 Tutorial Lecture4
34/52
The third step is carried using the arrow-based method of BN
identification:
4-34
8/12/2019 Tutorial Lecture4
35/52
The last step is up to the manager and his/her staff todetermine which actions should be taken to eliminate the BN.
4-35
8/12/2019 Tutorial Lecture4
36/52
4.9. Case Studies4.9.1. Automotive ignition coil processing system
Bottleneck identification:
Improving m9-10 by 10% and b9-10by 1 leads to TP= 505 parts/hour
4-36
8/12/2019 Tutorial Lecture4
37/52
Bottlenecks of the improved system:
Increasing b5by 1 leads to TP = 511 parts/hour an acceptable
performance.
4-37
8/12/2019 Tutorial Lecture4
38/52
Bottleneck identification:
The main reason for m3to be the bottleneck is starvation byempty carriers. Assuming the empty carriers are always
available, we obtain
4.9.2. Automotive paint shop production system
8/12/2019 Tutorial Lecture4
39/52
Bottlenecks of the improved system:
Increasing efficiency of m3by 4% leads to
and machine m4becomes the new bottleneck.
4-39
8/12/2019 Tutorial Lecture4
40/52
4.9.3. Automotive ignition module assembly system
Conclusion: MHS is not potent.
8/12/2019 Tutorial Lecture4
41/52
Increasing capacity of all buffers:
8/12/2019 Tutorial Lecture4
42/52
Increasing capacity of buffer conveyor: over 9% TP
improvement.
Eliminating starvations of Op.1 and Op.9 and blockage of Op.18:
Last two actions have been implemented.
8/12/2019 Tutorial Lecture4
43/52
4.10. Summary
In the same manner a medical doctor cannot treat patients
without taking their vital signs, production systems cannot be
managed without appropriate measurements.
This lecture shows that the most important vital signs of a
production system are blockages and starvations.
Based on this information, managers can exercise MBM a
rigorous way for achieving good performance of production
systems.
4-43
8/12/2019 Tutorial Lecture4
44/52
4.11. Lab:PSE ToolboxFunction for BN-m and
BN-b Identification
4-44
8/12/2019 Tutorial Lecture4
45/52
BN-m and BN-b in serial lines with Bernoulli machines
Input:
M, number of machines
p, reliability of each machine
N, capacity of each buffer
Output:
BN-m and BN-b
Production rate (PR)
Work-in-process (WIP)
Probability of starvation (ST)
Probability of blockage (BL)
4-45
8/12/2019 Tutorial Lecture4
46/52
4-46
8/12/2019 Tutorial Lecture4
47/52
BN-m and BN-b in serial lines with exponential machines Input:
M, number of machines
, failure rate of each machine
, repair rate of each machine
c, speed of each machine
N, capacity of each in-process buffer
Output: Throughput (TP)
Work-in-process (WIP) Probabilities of starvation (ST) and blockage (BL)
Machine efficiency (e)
BN-m and BN-b.
4-47
8/12/2019 Tutorial Lecture4
48/52
4-48
8/12/2019 Tutorial Lecture4
49/52
BN-m and BN-b in serial lines with general model ofmachine reliability
Input: M, number of machines
Tup, average uptime of each machine
Tdown, average downtime of each machine
Output: Probabilities of starvation (ST) and blockage (BL) BN-m and BN-b.
4-49
8/12/2019 Tutorial Lecture4
50/52
4-50
8/12/2019 Tutorial Lecture4
51/52
BN in assembly systems with Bernoulli machines
Input:
M0,M1,M2, number of machines in assembly line, component line 1and component line 2, respectively
p0, p1, p2, Bernoulli reliability of each machine
N0, N1, N2, capacity of each buffer
Output:
Production rate (PR)
Probability of starvation (ST) Probability of blockage (BL)
4-51
8/12/2019 Tutorial Lecture4
52/52