Consider the following layout problem.

Basic Data:

(i) Number of departments in the layout = 7

(ii) Areas of departments.

Department Function Area (sq. m.)
1 Receiving 24,000 2 Milling 12,000 3 Press 12,000 4 Assembly 16,000 5 Painting 12,000 6 Inspection 8000 7 Shipping 12,000 (iii) The relationship chart:

(iv) Minimum department preference value (MDP) = I = 4.
(v) Sweep width = 2 (vi) Number of iterations to be performed = 2.
Apply ALDEP algorithm to design a suitable layout by performing two iterations.AppendixLO1

Transcribed Image Text:

From 1 2 - A - 3 E U - 4 I E O 5 A I I I - 6 U I 0 U A - 7 I U U 0 I E To 1 2 3 4 5 6 7