Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
LAYOUT PLANNINGPACKAGES
CONSTRUCTION PROGRAMS - CORELAP - ALDEP - PLANET, LSP, LAYOPT, RMA Comp I IMPROVEMENT PROGRAMS - CRAFT - RUGR (based on graph theory)
Seehof, J.M and W.O. Evans Automated Layout Design Program:, The Journal of Industrial Engineering, Vol 18, No. 12, 1967, pp 690 - 695.
1 de 14
2 de 14
Mechanism of ALDEP
(a) 1st dept placed randomly. (b) Scan the REL chart for a dept with A,E rating (min dept preference) continue this step till no such dept exists. (c) Pick up the next dept. in a random fashion and again proceed by scanning the REL chart [step (b)].
3 de 14
4 de 14
Final Layout
5 de 14
Features of CORELAP
Retain the rectangular shape of each department. The layout is built around a central department. Placement and choice based on the total and current placement ratio. The final layout may end up with irregular boundaries.
CRAFT
Computerized Relative Allocation of Facilities Technique
Armour, G.C. and E.S.Buffa, A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities Management Science, Vol 9, No. 1, 1963, pp 294-309 Buffa, E.S, G.C. Armour and T.E. Vollman Allocating Facilities with CRAFT Harvard Business Review, Vol 42, No.2, 1964, pp 136 - 159.
An Example of CRAFT:
Product Processing sequence 1 2 3 ABCBCD ACBD ACBCBD Daily production 100 50 200 No of items in trolley 5 5 40 Trolley loads/ day 20 10 5
6 de 14
Initial Layout
From/ To
A D
A 1 2 1
B 1 1 2
C 2 1 1
D 1 2 1 -
A B C D
Load Matrix
From/ To A B C D A B 20 45 C 15 45 D 15 20 -
7 de 14
8 de 14
C D From/ To A B C D
45 A -
20 B 20 90 110
C D C 60 45 105
2 1
1 2 D 30 20 50
1 80 75 110 00 265
1 -
00
9 de 14
10 de 14
11 de 14
Limitations of CRAFT CRAFT yields a good heuristic solution that does not guarantee optimality This is because not all (n!) combinations are evaluated, but only (nC2) pair-wise exchange options are considered. In case departments are on unequal size, their centroids are exchanged which can result in irregular shapes of departments
Factorial Growth n 1 2 3 4 5 6 7 8 9 10 11 12 0 1 3 6 10 15 21 28 36 45 55 66 n! 1 2 4 24 120 720 5040 40320 362880 3628800 39916800 479001600
12 de 14
Summary of the CRAFT procedure This example demonstrates one iteration of the basic CRAFT procedure The best layout so produced is compared with the starting layout. If it is inferior to the starting layout, the starting layout is declared optimal and the search stops Otherwise a new iteration with the discovered layout as the starting node is initiated
Conclusions Computer packages for layout planning -Construction programs (ALDEP, CORELAP) -Improvement programs (CRAFT) Based on SLP procedure -Activity relationships -Material Handling Effort Good for generation of alternative layouts Limitations of irregular shapes, ignoring realistic constraints.
13 de 14
14 de 14