Sei sulla pagina 1di 14

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


Next Page >>

LAYOUT PLANNINGPACKAGES
CONSTRUCTION PROGRAMS - CORELAP - ALDEP - PLANET, LSP, LAYOPT, RMA Comp I IMPROVEMENT PROGRAMS - CRAFT - RUGR (based on graph theory)

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

ALDEP AUTOMATED LAYOUT DESIGN PROGRAM


Development within IBM

Seehof, J.M and W.O. Evans Automated Layout Design Program:, The Journal of Industrial Engineering, Vol 18, No. 12, 1967, pp 690 - 695.

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

ALDEP based on closeness Ratings


A E I O U X 0 = 64 = 16 =4 =1 =0 = -1,024

1 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Scoring Pattern of ALDEP


For a Cell (0) the scores of all eight neighbours areadded together (as per REL chart) Then the cell (0) is deleted so that it is not counted again. We then proceed to the next cell till all cells are exhausted. The final cumulative score is the Layout Score
2 1 8 3 0 7 4 5 6

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Inputs Requirements for ALDEP


Length, Width and area requirements for each floor. Scale of layout printout (max 30x50) No. of depts. in the layout No. of layouts to be generated Minimum allowable score for an acceptable layout. Minimum dept. preference (A or E) REL chart for the depts. Location and size of restricted area for each floor.

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Vertical Scanning Pattern for placing depts. in ALDEP

2 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

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)].

Module 7 : An Example of ALDEP


<< Prev Page Next Page >>

The Available Space

Module 7 : An Example of ALDEP

3 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

<< Prev Page

Next Page >>

Placement of 1st Department

Module 7 : An Example of ALDEP


<< Prev Page Next Page >>

Placement of 2nd Department

Module 7 : An Example of ALDEP


<< Prev Page Next Page >>

Placement of 3rd Department

4 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : An Example of ALDEP


<< Prev Page Next Page >>

Placement of 4th Department

Module 7 : An Example of ALDEP


<< Prev Page Next Page >>

Final Layout

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

5 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

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.

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

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.

Module 7 : An Example of CRAFT


<< Prev Page Next page >>

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

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : An Example of CRAFT


<< Prev Page Next page >>

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

Distance Matrix for initial layout (Assuming Rectilinear Distances)

Module 7 : An Example of CRAFT


<< Prev Page Next page >>

Load Matrix
From/ To A B C D A B 20 45 C 15 45 D 15 20 -

Module 7 : An Example of CRAFT


<< Prev Page Next page >>

Unit Cost Matrix


From/ To A B C D A 1 2 1 B 1 1 1 C 2 1 1 D 1 1 1 -

7 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : An Example of CRAFT


<< Prev Page Next page >>

Load x Unit Cost Matrix (Flow Matrix)


From/ To A B C D A 1 2 1 00 B 1 1 1 65 C 2 1 1 75 D 1 1 1 50 60 65 00 35

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Initial Layout (Distance Matrix)


From/ To A B C D A 1 2 1 B 1 1 2 C 2 1 1 D 1 2 1 -

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Material Handling Effort for Initial Layout


From/To A B A B 20 C 30 45 D 15 From/To A B A 1 B 1 C 2 D 1 2

8 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

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

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Pair wise Exchanges

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Alternative 1 (Distance Matrix)


From/ To A B C D A 1 1 2 B 1 2 1 C 1 2 1 D 2 1 1 -

Material Handling Effort = Flow x Distance Matrix = 220

Module 7 : COMPUTERISED LAYOUT PLANNING

9 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

<< Prev Page

Next Page >>

Alternative 2(Distance Matrix)


From/ To A B C D A 1 2 1 B 1 1 2 C 2 1 1 D 1 2 1 -

Material Handling Effort = Flow x Distance Matrix = 265

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Alternative 3(Distance Matrix)


From/ To A B C D A 2 1 1 B 2 1 1 C 1 1 2 D 1 1 2 -

Material Handling Effort = Flow x Distance Matrix = 215

Module 7 : LAYOUT PLANNING


<< Prev Page Next page >>

Alternative 4(Distance Matrix)


From/ To A B C D A 2 1 1 B 2 1 1 C 1 1 2 D 1 1 2 -

Material Handling Effort = Flow x Distance Matrix = 215

10 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Alternative 5(Distance Matrix)


From/ To A B C D A 1 2 1 B 1 1 2 C 2 1 1 D 1 2 1 -

Material Handling Effort = Flow x Distance Matrix = 265

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Alternative 6 (Distance Matrix)


From/ To A B C D A 1 1 2 B 1 2 1 C 1 2 1 D 2 1 1 -

Material Handling Effort = Flow x Distance Matrix = 220

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

Pair wise Exchanges

11 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

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

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

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

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

12 de 14

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page Next Page >>

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

Module 7 : COMPUTERISED LAYOUT PLANNING


<< Prev Page TOP

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

22/04/2014 04:12 p.m.

Module 7: COMPUTERISED LAYOUT PLANNING

http://nptel.ac.in/courses/Webcourse-contents/IIT-Delhi/project and production management/mo...

14 de 14

22/04/2014 04:12 p.m.

Potrebbero piacerti anche