Professional Documents
Culture Documents
Market
Assessment
Specification
MANUFACTURE
Plant location
Concept
Design
Plant layout
Production scheduling
Detail
Design
Manufacture
Plant Location
Possible Factory Location
Criterion
Weighting
PROXIMITY TO:
Skilled labour
14
21
28
40
16
32
16
A motorway
21
14
21
28
An airport
12
16
Housing
20
15
15
20
Amenities
15
10
10
15
14
35
21
14
Availability of grants/incentives
16
40
24
Safety
10
Planning constraints
10
15
25
20
10
Environmental impact
12
16
TOTAL
164
138
149
150
175
Material 1
ASSEMBLY
1
A
S
S
E
M
B
L
Y
CELL 1
ASSEMBLY
CELL 2
Flexible.
ASSEMBLY
ASSEMBLY
Part
Route
Part
Route
1
2
3
4
5
6
7
8
L1,L2,M1,D1,G1,F
L1,M1,D1,G2,F
L2,M1,D1,M2,G1
L2,D1,M1,M2,G2,G1
L1,L2,M2,G1,D2,G2
L2,M1,D1,G2,G1
L1,M1,D1,G1,D1,G1,F
L2,D2,G1,D2,G1,G2
9
10
11
12
13
14
15
16
L3,M1,G2,M1,D1,G2
L2,L3,M1,G1,G2,F
L2,M1,G1,M1,G2,F
L1,L2,M1,D1,M2,G1
L1,L3,M1,D1,G2,F
L3,M1,G1,M1,G1,G2,F
L1,M2,D2,G1,G2
L1,M1,D1,M2,G1,F
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
L1
L2
1
1
L3
D1
1
1
1
1
1
1
1
1
M1
1
1
1
1
1
1
1
1
1
1
1
D2
M2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
G2
1
1
1
1
1
G1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Proximity between
machines/clusters
8
1
1
1
1
1
1
1
1
1
1
1
6
1
1
1
1
d pq apj aqj
j 1
a=1 used
a=0 not used
7 16 12
2 13
9 10 11 14
5 15
L2
M1
L1
L3
8
Cell A
Routes 1, 7, 16
D1
Cell C
Routes 2, 13, 9
L2
M2
D2
8
M1
L1
L1
G1
M2
L2
M1
Cell B
Routes 12, 3, 4, 6
D1
G1
G2
M2
L2
G2
Cell D
Routes 10, 11, 14
G2
M1
G1
G1
G2
Cell E
Routes 8, 5, 15
D1
L3
Machine
No. before
No. after
L1
L2
L3
D1
D2
M1
M2
G1
G2
F
4
4
4
4
1
4
4
4
4
4
4
4
2
3
1
4
3
4
4
3
37
32
Total
COMPONENTS
MATERIAL
Random Layout
Very inefficient
Small factories, start-up companies.
Process Layout
Process industries, e.g. steelmaking.
The process determines layout.
LABOUR
PRODUCT
LABOUR
MATERIAL
COMPONENTS
Minimise average
processing time
Schedule ABC
I.
A
Time
Schedule CAB
II.
A
C
1
B
3
Time
EDD
Schedule in order of
earliest due date
WEDD Schedule in order of
weighted earliest due date
A B C D E
Schedule ABCDE
Prep.
6 7
6 2
B
6
5 6
3 4
Phot.
C
13
D
17
19
11 13
Time
23 25
25
E
28
32
Johnsons Algorithm
Step 1.
Find next job with the
shortest processing time on either
machine.
Step 2.
If on 1st machine then
schedule at next earliest position.
Step 3.
If on 2nd machine then
schedule at next latest position.
Prep.
C
2
Phot.
B
6
E
2
19
13
C
D A
B
12
D
25
A
19
DA
24
28
31
Machine 1
C
25
43
H
55
Time
61
Machine 2
12
28
28
12
J
55 60 64
45
Machine 3
17
21
K
25
4
M
10
G
H
F
31
M
46
54
61
Operation
Time
Required
(h)
Predecessors
Earliest
Start
A
B
C
D
E
F
G
H
I
J
K
3
3
1
2
8
4
1
4
12
6
4
A
C
A, D
F
C
B, E, G
H, I, J
3(A)
1(C)
3(A), 1+2(D)
4(F)
1(C)
3+3B, 3+8(E), 4+1(G)
4(H), 1+12(I), 11+6(J)
0
3
0
1
3
0
4
0
1
11
17
Allowable slack
Critical path
17
Earliest
Latest
start time finish time
4
C
0
I
1
1
D
17
17
12
Operation
time
3
3
11
11
11
3
F
0
G
10
17
6
C
F
H
D
B
E
G
J
11
1
21
4
3
2
Operation period
K
8
16
Time (h)
Bill of
Materials
Current
Inventory
Purchasing
Schedule
Material
Control
Schedule
Manufacturing
Schedule
Week
10
41
42
Product P65
10
20
20
20
Product K92
15
20
20
25
15
20
20
20
Product U37
30
35
45
30
30
30
30
Current week
Current week: 4
10
41
42
Forecast
demand
10 10
10
10
10
10
10
10
MPS
10
20
20
20
Orders
accepted
Available to
promise
15
18
20
(Current stock + MPS) (Total orders to next production run) = Stock available to promise
10 + 10
Planning
period
37
38
Gross
requirements
10 20
10
30
10
20
20
Scheduled
receipts
10
10
20
20
25
Net
requirements
25
Planned order
receipts
35
Planned order
releases
Projected
inventory
10
40
35
10
15
10
10
20
Let
C0 = Cost of placing an order,
CH = Cost (per year) of holding a single unit in stock
D = Demand rate (no. units per year)
No. orders per year = D/Q
Order
Arrives
Time
COD CHQ
T
dT
C D C
O2 H 0
To minimize cost set dQ
Q
2
2COD
Q *
So the economic order quantity,
C
1/ 2
C D C Q
T O H
Q
2
Q
Demand is never truly predictable.
What happens if we get the value of Q slightly
wrong?
COD
C Q * (1 )
H
Q * (1 )
2
C D CH
O
(1 ) 2DCO
DCOCH
1/ 2
DCOCH
1/ 2
1/ 2
C (1 ) 2COD
H
2
CH
1/ 2
(1 2 3 ... 1 )
Visibility of performance
Simple flow of material allows each member of the workforce to see how their work
fits into the rest of the factory, and therefore allows rapid problem solving.
Nothing can be made without an authorizing kanban from the next process
in line.
Kanban system ensures nothing is made that is not required, and everything
is made just in time.
Kanbans specify the item, number to be used in each batch, stocking
locations, the material required and where to find it.
Production-kanbans move with the parts as they are processed, with a
different production-kanban for each operation.
Move-kanbans remain between one workstation and the next.
In both cases there is a well defined quantity of parts referred to that are
kept in a container holding exactly that number.
A Kanban System
Kanban authorizing
production at workstation A
P
Workstation
A
Workstation
B
Containers waiting
to be moved to
workstation B
Parts waiting to
be processed at
workstation B
Production transaction
Move transaction
If demand stops suddenly then production continues until every kanban is attached to
a full container. Represents the maximum amount of inventory possible.
Only works well for repetitive production, and for a relatively stable level of demand.
Kanban is a pull system where parts are only processed at one workstation when
there is a requirement from the following workstation. In a push system parts are
continued to be processed at workstation A whether or not they are required at
workstation B. If they are not required at B, e.g. due to machine failure, then parts
processed at A queue up to be processed at B and inventory levels rise unnecessarily
and control of inventory becomes difficult. However, in the kanban system if one
workstation fails then authorization for movement to that workstation stops and the
whole process comes to a halt. The system therefore demands strict discipline in
maintenance.
Market
Assessment
Specification
SELL
Concept
Design
Manufacture
Sell