Lean Manufacturing: Changed The World (1991) - in The Book, The Authors Examined The
Lean Manufacturing: Changed The World (1991) - in The Book, The Authors Examined The
Lean Manufacturing: Changed The World (1991) - in The Book, The Authors Examined The
Lean manufacturing or lean production are reasonably new terms that can be
traced to Jim Womack, Daniel Jones and Daniel Roos’ book, The Machine that
changed the world [1991]. In the book, the authors examined the
manufacturing activities exemplified by the Toyota Production System. Lean
manufacturing is the systematic elimination of waste. As the name implies, lean
is focused at cutting “fat” from production activities. It has also been successfully
applied to administrative and engineering activities as well. Although lean
manufacturing is a relatively new term, many of the tools used in lean can be
traced back to Fredrick Taylor and the Gilbreaths at the turn of the 20th century.
What Lean has done is to package some well-respected industrial/manufacturing
engineering practices into a system that can work in virtually any environment.
Figure 18.1 provides a definition of lean as a function of the outcomes that one
realizes. The definition comes from Womack and it identifies the results rather
than the method of lean. In the following sections, the procedures and specifics
of lean will be introducted.
Definition of “Lean”
• Half the hours of human effort in the factory
• Half the defects in the finished product
• One-third the hours of engineering effort
• Half the factory space for the same output
• A tenth or less of in-process inventories
Excess production results in waste because it captures resources too early and
retains the value that is added until the product can be used (sold). In today’s
highly changing society, many items produced before they can are sold to a
specific customer often go obsolete before demand is realized. This means that
a perfectly good product is often scrapped because it is obsolete. Producing a
product simply to keep a production resource busy (either machine, operator or
both) is a practice that should be avoided.
Delays, such as waiting for raw material, also result in the poor use of capacity
and increased delivery time. Raw materials and component parts should be
completed at approximately the time that they will be required by downstream
resources. Too early is not good, but late is even worse.
7 Forms of Waste
CORRECTION
Repair or MOTION
WAITING
Rework Any wasted motion
Any non-work time to pick up parts or
waiting for tools, stack parts. Also
supplies, parts, etc.. wasted walking
Types
PROCESSING of OVERPRODUCTION
Producing more
Doing more work than Waste than is needed
is necessary
before it is needed
INVENTORY
Maintaining excess CONVEYANCE
inventory of raw mat’ls, Wasted effort to transport
parts in process, or materials, parts, or
finished goods. finished goods into or
out of storage, or
between
processes.
part ends up in the wrong place, and 3) the part is damaged in transit and
requires rework or scrap. Two of the three outcomes are no desirable, which
further leads to minimizing handling. Because material handling occurs between
all operations, when possible, the handling should be integrated into the process,
and the transport distances minimized.
Insufficient (or poor) process performance always results in the over utilization of
manufacturing resources and a more costly product. There is no optimal process
in that improvements can always be made; however, many processes operate far
below the desired efficiency. Continuous process improvement is necessary for
a manufacturing firm to remain competitive. Excess movement or unnecessary
part handling should be the first targets of waste elimination.
Poor quality (making defects) is never desirable. Labor and material waste
results from producing any defect. Furthermore, the cost of mitigating poor
quality (rework) can often exceed the price of the product. A critical balance
between processing speed and quality exists. A process should be run as fast
as possible without sacrificing acceptable quality.
From the above discussion, it should be obvious that waste is a constant enemy
of manufacturing. Waste elimination should be an on-going process that focuses
on improving a process regularly. Regular reviews and worker input should be
conducted as often as allowable.
Inconsistent Inconsistent
Process Results
Consistent Desired
Process Results
For this exercise, you should identify a process at work or school that you
feel lends itself to waste elimination. You should first characterize the process,
noting the value added and non-value added activities. The non-value added
activities should be eliminated (if possible). The value added activities should be
examined and analyzed for potential improvements. Describe the system as it
exists and as you think it should be. Describe how you went about identifying
and eliminating waste.
M M D L D D
D D
M M L L
M G G
M L L
G G
M M A A
G G
A A
Part #1 L L M D G
A A
Receiving L M G G
Part #2
L M D Shipping
Part #3
Process layout is typically employed for a large variety of products that are
made in very small batches (ones or twos). The advantages of Process Layout
are: 1) the flexibility of the system to product almost any part that fits within the
volumemetric boundaries of the machines, 2) an i n depth understanding of a
specific process can be obtained, and 3) some tooling and fixtures can be
shared. The disadvantages of process layout are: 1) the spaghetti flow is
difficult to manage and control, 2) there is usually a lot of inventory in front of
each machine, 3) set up is usually expensive, 4) material handling times are
large, and 5) it is difficult to automate these types of systems.
Product layout systems are used effectively for the economic production of
high volume goods. The advantages of these systems are: 1) large batches can
be produced inexpensively, 2) material handling is minimal, 3) in-process
materials are minimized, 4) it is easy to control these systems, and 5) automation
is more achievable and justifiable. The disadvantages of these systems are: 1)
they are inflexible, in that only one or very few products can be produced on
them, 2) set up time for these systems is very large, and 3) duplicate tooling is
required to replace worn tooling so that maintenance can be minimized.
large volumes to offset these initial costs and then the changeover costs
associated with these systems.
In FFA (Figure 18.10), dominant material flows between shops (or buildings)
are identified. In addition, if parts are observed to backtrack between any of the
shops, these flows are eliminated by a minor redeployment of equipment. FFA
may often be redundant for a factory that essentially consists of a single machine
or fabrication shop.
11
MATERIAL
28
16 2
15
1
27 3
53 1 3
1
1
1 24
3 1
126
84 151 3
4
8
1
1 12 26
3 DEPARTMENTS
9 27 1 = BLANKS
5 45 1 2 = SHEET METAL WORK
3 3 = FORGE
1 4 = WELDING DEPT
2 5 = MACHINE SHOP
6 = ASSEMBLY
9 = OUTSIDE FIRMS
FINISHED
6
PRODUCT
MATERIALS 1 MATERIALS 1
5 4 3 2 5 3&4 2
6 6
FINISHED FINISHED
PRODUCT PRODUCT
In GA (Figure 18.11), the flows in each of the shops identified by FFA are
analyzed. GA analyzes operation sequences of the parts being produced in a
particular shop to identify manufacturing cells. Loads are calculated for each part
family to obtain the equipment requirements for each cell. Each cell usually
contains all the equipment necessary to satisfy the complete manufacturing
requirements of its part family. Due to sharing and non-availability of equipment,
some inter-cell material flows and flows to/from vendors may arise.
12
PART/PRODUCT
K L L M M L M M E E E E E K E E K E M K M M M K E E E K K M E
4 4 4 4 4 4 4 4 4 4 3 1 1 4 4 4 3 3 4 4 4 4 4 3 7 4 3 4 4 6 1
8 8 8 4 7 8 8 4 1 8 4 2 2 7 7 8 4 3 8 4 5 5 8 4 3 6 3 5 3 1 8
2 3 2 2 6 3 1 2 7 5 2 2 2 6 7 5 5 4 2 2 6 6 3 0 9 3 2 1 5 5 6
5 8 6 7 9 8 9 7 9 9 6 0 8 9 8 8 9 9 6 7 9 9 8 9 2 6 9 9 9 9 9
1 8 7 6 3 8 5 6 5 6 7 4 8 7 2 6 6 4 5 6 1 1 6 8 4 5 9 0 2 4
A B E F M C D D C D B H A
M DMT(3) X X X X X X X X X X
A DM(3) X X X X X X X X X X X X X
C
H PG X X X X X X
I DXY(3) X X X X X X X X
N P&GR X
E
/ PGR X X
W PGH
O
R
K PGG X X X
S P&G X X X X X X X X X X X X X
T
A RP X
T PGB X X X X X X
I
W&P X X X X X
O
N WG3 X
COMPONENT – MACHINE CHART. INITIAL RECORD. FORGE.
PART/PRODUCT
L K M E K L E K K K M M M E E E E E M K L M M M K E E E E E M
4 3 4 3 4 4 7 3 4 4 6 4 4 3 1 1 4 4 4 4 4 4 4 4 4 4 4 1 3 4 4
8 4 8 3 4 8 3 4 5 3 1 8 4 4 2 8 1 8 8 8 8 5 5 4 7 7 6 2 3 8 7
2 5 2 4 2 3 9 0 1 5 5 1 2 2 2 6 7 5 3 2 3 6 6 2 6 7 3 2 2 5 6
6 9 6 9 7 8 2 9 9 9 9 9 7 6 0 9 9 9 8 5 8 9 9 7 9 8 6 8 9 8 9
7 6 5 4 6 8 8 9 0 2 5 6 7 4 4 5 6 6 1 8 1 1 6 7 2 4 8 5 6 3
B D C M A C D H A D B E F
PG X X X X X X
GROUP-1
DM 3/1 X X X X
M DXY 3/1 X X
A RP X
C FAMILY - 1
H
I P&G X X X X X X X X X X X X ONE “EXCEPTION” X
N DMT 3/2 X X X X X X
E DM 3/2 X X X X X X
/
GROUP-2
W DXY 3/2 X X X X X X
O W&P X X X X X
R WG3 X
K
S FAMILY - 2
T PGG X X X
GROUP-3
A PGB X X X X X X
T
I PGR X X
O DMT 3/3 X X X X
N DM 3/3 X X X
P&GR X
FAMILY –3
COMPONENT – MACHINE CHART. AFTER FINDING FAMILIES AND GROUPS
MATERIAL
65 7
1
1 2 3 2
HS4 MO HS
1
2 6
11
3 3 2 4
5 7 6 4
MV DH MH DS
1 1
1
8
SA
41 2 5 4 4 16 2
MATERIALS
72
1
HS4
17 6 4 3
4 2 6 1 7 5
42 1
DH MH DS MV
1 2
8
15
5
8
SA
72
Several techniques are available to form clusters for FFA, GA, LA and TA.
These techniques use routing or process planning information in order to identify
families. In the following sections, some of these techniques will be described
and illustrated.
King (1979) presented a rank -order cluster algorithm that is quite simple. We
use his method to show how component families can be determined in our shop.
The data from Table 18.2 will be used to illustrate this procedure. King’s
algorithm can be stated as follows:
w j = ∑ 2 i M ij
∀j
15
wj = ∑ 2 j M ij
∀j
The rank -order clustering algorithm sorts the matrix into a diagonal block
structure. The diagonal blocks are not always mutually exclusive. Final
judgment has to me made by the user.
One of the major drawbacks of applying this algorithm is the need of
storing the binary word. In order to implement this procedure on a computer, the
word length is max (n, m), where n is the number of machines, and m is the
number of components. For a moderate problem with 50 machines and 2000
components, it is impossible to calculate the weights before sorting. For the
16
machine weights, 50 words of 2000 bits are needed! A word of 2000 bits
requires 250 bytes. To overcome this problem, direct comparison of elements,
either row or column, can be used. A digit-by-digit comparison is performed,
beginning from the most significant digit. Each row or column of the matrix is
treated as a binary number; no weight is ever calculated. Unfortunately, this
procedure has a computational complexity of a cubic order, namely, O[ij(i + j)]
(King and Nakornchai, 1982), where i and j are the number of rows, and
columns, respectively.
Table 18.3 shows the procedure of rearranging the PFA matrix in from
Table 18.2.
positive cells to the top of the matrix. In repeated trips, the positive cells move
toward the diagonal of the matrix in a clustered pattern.
The basic rule is that each component or machine must be moved
together with its respective row or column entries during matrix transformation,
as if the cells or the blocks were linked together by imaginary rods. The
algorithmic procedure is as follows.
wi = ∑ Mi j
∀j
wj = ∑ Mij
∀j
Sort columns in ascending order.
Step 3. For i = 1 to n, move all columns j, where M ij = 1, to the right,
maintaining the order of the previous rows.
Step 4. For j = m to 1, move all rows i, where M ij = 1, to the top
maintaining the order of the previous columns.
Step 5. If the current matrix is the same as the previous matrix, stop, or
else go to step 3.
The same PFA matrix in Table 18.2 is rearranged using the direct clustering
algorithm. The procedure and result are shown in Table 18.4. As can be seen
the result in this figure is the same as that obtained by the rank-order clustering
algorithm. However, the direct clustering algorithm does not always work. When
one or several of the machines are bottleneck machines, the iteration stops very
quickly. A bottleneck machine is a machine that is used by a large number of
components and prevents the further rearrangement of columns. The rest of the
matrix is not rearranged because bottleneck machines block them. It happens
especially in large matrices. To solve the bottleneck problem, human
intervention is needed. When the iteration stops prematurely, identify the
bottleneck machines and continue the iteration, disregarding the order of those
rows.
We also may have a final matrix with blocks not mutually exclusive. When
closely investigating the matrix, we may find that only a few cells caused this
problem. Those cells can be considered as exception cells. Mark the exception
cells with an asterisk (*), treat them as negative cells and then reapply the
algorithm. Another technique increases the number of machines of a specific
type and merges machines of the same type. This can be done by adding new
rows and merging two rows respectively. More elaborate examples of the direct
clustering algorithm can be found in Chan and Milner (1982) and King and
Nakornchai (1982).
19
The results also vary. Family formation is not always objective; many other
factors such as the cost of implementing the machine cell and material-handling
costs have to be considered. The problem should not be considered as just
clustering cells in an incidence matrix. The methods discussed here provide a
starting point for further improvement.
In solving the group-technology problem, there are two approaches that have
been used extensively: heuristic algorithms and mathematical programming
models. Mathematical programming deals with the optimization of a function
20
In a typical facility layout study, it is assumed that the layout design will
eliminate inefficient material flow in the facility. Therefore, no effort is made to
simplify the material flow network that is input to the block layout algorithm that
generates the optimal layout. The symptoms shown in Table 18.5 usually
indicate the inefficiency of material flows in a facility that is due to one or more of
the causes listed in Table 18.6.
22
Since PFAST algorithms use three types of input data – operation sequences,
machine-part matrices and From-To charts – they could be used for a variety of
applications, as listed in Tables 18.8 (a)-(c).
its machine-part matrix (Table 18.11), asymmetric From-To Chart (Table 18.12)
and symmetric From-To Chart (Table 18.13) for the machines.
Table 18.12 Asymmetric From-To Chart for the Routings in Table 18.9
Machine 1 2 3 4 5 6 7 8 9 10 11 12
1 1 8 2 3
2 1 1
3 2
4 9 11
5 1 1
6 4 3 3
7 5 2 5 6 3 2
8 3 8
9
10 3 3
11 5 3 4
12
27
Table 18.13 Symmetric From-To Chart for the Routings in Table 18.9
TO
1 2 3 4 5 6 7 8 9 10 11 12
1 1 8 2 3
F 2 1 1 1
R 3 2
O 4 4 14 11
M 5 1
6 3 3
7 5 5 9 8 2
8 8
9
10 6
11 4
12
18.3.3.2 Using PFAST for Material Flow Simplification and Facility Layout
The algorithms in PFAST use three types of input data operation sequences,
machine-part matrix and From-To Chart instead of only From-To charts. This
makes it possible to use the outputs from two or more programs in a synergistic
fashion. In this section, some examples of these synergistic uses are presented
to illustrate the possibility of simplifying the material flow network in a facility prior
to designing a physical layout for it.
Distance
0.90
Threshold for
Cluster Formation
0.60
0.30
0.00
2 10 1 3 4 7 8 9 5 6 18 11 12 17 13 14 15 16 19
Parts
Exceptional parts
Distance
0.76 Threshold for
Cluster Formation
0.51
0.25
0.00
1 7 4 3 5 6 2 10 8 9 12 17 14 18 11 13 19 15 16
Parts
7
M2 S3, S15, S16, S17 1 7 11 10
12
M3 S4 3→ 5
M4 S10, S12, S13 6 10 7 9
32
M4 2 M1 1 M3
3 1 M2
Figure 18.16 Next Generation Layout (NGL) for the Facility described in
Table 18.9
R
3
1 3 5 2
5
4 6 2
8
4
7 7 9
8
Aisle
11 10
9 11 10
12
12
Figure 18.17(a) Design Skeleton obtained by Algorithm MSA Figure 18.17(b) Final Layout based on Design Skeleton in Figure
18.17(a)
33
Aisle
4 8 9 10
11
7
6
7 12
4 9
1 8
11 6
10
5 3
3 2
12
2
Figure 18.18(a) Design Skeleton obtained by Algorithm MST Figure 18.18(b) Final Layout based on
Design Skeleton in Figure 18.18(a)
4 10
8 11
35
30
20
15
10
0
2 4 11 14 18 1 5 7 10 16 19 3 6 8 9 12 13 15 17
Routing #
Figure 18.20 Sorting of Routings using Algorithm SORT-PQ
and 5. And, in the cluster of parts 12~17, parts 15 and 16 are the only ones that
require machine 1 for their first operations, whereas, machine 1 is used by all the
parts (1~5) in the other cluster.
From the above example, the reader should see that PFA is a highly
interactive process even using analytical and computer tools. PFA can be
effectively used to form part families and manufacturing calls; however, the
process is not automatic.
But this is less than half the story. In a column of marching soldiers, the problem
is not a slow marcher falling behind. Each soldier carries the same weight, so the
line is balanced, and there is no pronounced bottleneck. The problem is
variability amplification: If the
first soldier for some reason speeds up a little bit, the second soldier will see a
gap open in front of him, and take this as a signal to speed up, as well. But he
will have to speed up more than the first soldier did, in order to catch up with him.
When he has caught up, he
then needs to slow down again to avoid bumping into the one in front.
Now the third soldier sees a gap opening up even faster than the second one did,
so he has to speed up by even more, and has to slow down more abruptly when
he has closed the gap. This way, the small change in speed amplifies down the
line like a whiplash, and the poor guy at the end of the line will alternate between
running flat out and marching in place.
36
This is what occurs in a kanban line. The last machine in the line tries to track the
demand process, but adds some noise to it due to process variability. The
second last machine tries to track the input process of the last machine, but adds
some more noise. This amplifies the noise upstream, so the first machine in the
line will alternate between working at capacity and waiting for something to be
taken out of its output buffer. To get rid of the problem, one has to eliminate all
process variability, such as machine failures and operation time variability. This
can be time-consuming and expensive.
How do soldiers counteract this age-old problem? If the soldiers are recruits,
they get the attention of a very loud drill sergeant that yells out the cadence.
More seasoned soldiers will be singing a marching song as they go along, and
any infantry outfit has a large supply of these songs. Both of these techniques
have the effect of distributing the proper cadence to every soldier in the line,
simultaneously.
This is what the CONWIP control does. It passes the demand information,
without any noise, to the first machine in the line. All downstream machines know
that any part arriving in their input buffer can be worked on, so they hear the
signal, too.
But marching soldiers do not close their eyes and march blindly. Even if they
receive the proper cadence, they will still be watching the distance to the marcher
in front. If the gap widens, they will take longer strides, and if it narrows, they will
shorten their steps. This
way, the marchers act on two types of information at once: The global
information flow that determines the overall speed, and the local information that
is used for minor adjustments.
This is also the way our hybrid policy works: The CONWIP control gives a global
information flow (like the drill sergeant), and the kanban control gives a local flow
of information (like watching the distance to the guy in front). In our hybrid policy,
the global information flow from the demand process is supplemented by the
local information from the buffer levels. This attains the advantages of CONWIP
control, while using the strengths of kanban control to cancel its disadvantages.
Step 2: Map
Identify the value stream, the set of all specific actions required to
bring a specific product through the three critical management tasks of any
business: the problem-solving task, the information management task, and the
physical transformation task. Create a map of the Current State and the Future
State of the value stream. Identify and categorize waste in the Current State, and
eliminate it!
Step 3: Flow
Make the remaining steps in the value stream flow. Eliminate
functional barriers and develop a product-focused organization that dramatically
improves lead-time.
Step 4: Pull
Let the customer pull products as needed, eliminating the need for
a sales forecast.
Step 5: Perfection
There is no end to the process of reducing effort, time, space,
cost, and mistakes. Return to the first step and begin the next lean
transformation, offering a product that is ever more nearly what the customer
wants.
18.6 References
Arvindh, B. and Irani, S. A. (1994). Cell formation: The need for an integrated
solution of the subproblems. International Journal of Production Research, 32(5),
1197-1218.
Chen, C.Y. and Irani, S.A. (1993). Cluster first-sequence last heuristics for
generating block diagonal forms for a machine-part matrix. International Journal
of Production Research, 31(11), 2623-2647.
Daita, S.T., Irani, S.A. and Kotamraju, S. Algorithms for production flow analysis.
To appear in International Journal of Production Research.
Irani, S.A., Huang. H. and Udai, T. K. Custom design of facility layouts for multi-
product facilities using layout modules. Submitted to IEEE Transaction on
Robotics and Automation: Special Issue on Automation of Manufacturing
Systems Design.
Irani, S.A. and Udai, T. K. Facility layout using directed flow paths. Submitted to
IIE Transactions.
Irani, S.A. and Huang, H. (1998). Layout Modules: A novel extension of hybrid
cellular layouts. Proceedings of the 1998 International Mechanical Engineering
Congress and Exposition, Winter Annual Meeting of the ASME, November 15-20,
Anaheim, CA.
Irani, S.A., Cavalier, T.M. and Cohen P. H. (1993). Virtual manufacturing cells:
Exploiting layout design and intercell flows for the machine sharing problem,
International Journal of Production Research, 31(4), 791-810.
Minitab (Rel. 11) Reference Manual (1996, June). State College, PA: Minitab Inc.
39
Glossary of terms
green - no problems
yellow - situation requires attention
red - production stopped; attention urgently needed
jutsu - to talk, or ‘the art of’ (i.e., 'leanjutsu: the art of lean production').
1.All production and movement of parts and material take place only as
required by a downstream operation, i.e. all manufacturing and
procurement are ultimately driven by the requirements of final
assembly or the equivalent.
41
mura - inconsistency
muri - unreasonablness
5S’s - refers to the five Japanese words seiri, seiton, seison, seiketsu,
shitsuke. These words are shorthand expressions for principles of maintaining
an effective, efficient workplace.
setup time - work required to change over a machine or process from one
item or operation to the next item or operation; can be divided into two types:
1.internal: setup work that can be done only when the machine or
process is not actively engaged in production; OR
2.external: setup work that can be done concurrently with the
machine or process performing production duties.
takt time - takt, is a German term for rhythm or pace. Takt time is the
allowable time to produce one product at the rate a customer demands it. This is
44
NOT the same as cycle time, which is the normal time to complete an operation
on a product (which should be less than or equal to takt time).
Toyota - changed from the true form, Toyoda, meaning abundant rice
field, by the Toyota marketing department. Toyoda is the family name of the
founders of the Toyota Motor Company.
water spider - one who performs a wide range of tasks which allow
workers to perform 'value -added' tasks.
WCM - world class manufacturing is the philosophy of being the best, the
fastest, and the lowest cost producer of a product or service. It implies the
constant improvement of products , processes, and services to remain an
industry leader and provide the best choice for customers, regardless of where
they are in the process.
Outline:
§ Introduction to Lean Manufacturing
§ Set-up reduction
§ Group technology
§ Control of lean systems
§ Product examples and illustrations
§ Chapter summary
Review Questions
Review Problems
References/Bibliography