Uploaded by Ece Ertuğrul

LOGI2332 Week 5 (SLP and Blockplan).pdf (2)

advertisement
Facility Layout
Techniques
SLP AND BLOCKPLAN
1
https://richardmuther.com/wp-content/uploads/2014/06/RMA-1146-SLP-Overview-Mfg.pdf
2
Systematic Layout Planning, SLP
(Muther ,1973)
Qualitative approach to solve layout problem
Defines adjaceny relationships for each department pair.
The goal is to locate two areas with high frequency and logical relationship close to
one another using straightforward procedure
Adjaceny or closeness rating:
◦
◦
◦
◦
◦
◦
A – Absolutely necessary
E – Especially important
I – Important
O – Ordinary
U – Unimportant
X - Undesirable
SLP
Steps:
1. Chart relationships
2. Establish space requirements
3. Activity relationships diagram
4. Layout space relationships
5. Evaluate alternative arrangements
6. Select layout and install
D Suhardini et al 2017 IOP Conf. Ser.: Mater. Sci. Eng. 277 5
012051
•A – Absolutely necessary
•E – Especially important
•I – Important
•O – Okay
•U – Unimportant
•X – Undesirable
6
current state relationship map
7
rearrangement
8
SLP
To compare alternative layouts we may use two criteria;
◦ Normalized Adjacency Score = Adjacency score / upper limit
◦ R-Score
9
Main steps to follow (summary)
A. Determination of the departments that are being organized first.
◦ i)chose the department that has the most number of A relations (if not look E, I… )
◦ İi) If there exist a same number of A relations, compare their number of E relations.
B. For the second department:
i) The department should have an A relation with the first department.
ii) Except for the relation wit5h the first one, the department should have the
maximum number of A relation.
İn case of equal number og A’s, check E’s..
C. For the 3rd department,
i) İt should have the maximum compounded relationship level with the first two
selected department.
Hierarchy of the comp. Rel.
AA-AE-AI-AO-AU-EE-EI-EO-EU-II-IO-IU-OU
İn case of equal max com. Rel., look at the comp. Rel. With the unselected department.
REPEAT IT TILL THE END.
10
Scores: A:10, E:5, I: 2, O:1, U:0, X:-10
Example 1
Arrange 8 departments into 6x7 unit square based on given information below.
Departments
Square
Meter
1
1500
2
4500
3
5000
4
1500
5
2000
6
1500
7
2500
8
2500
Unit-square
11
DO THE PUZZLE
6X7 (GIVEN) – ONE SUGGESTED ALTERNATIVE
3
3
3
3
3
3
7
3
3
3
3
6
6
7
1
4
4
5
5
6
7
1
1
4
5
5
8
7
2
2
8
8
8
8
7
2
2
2
2
2
2
2
12
EXAMPLE 2 – your turn
Scores: A:10, E:5, I: 2, O:1, U:0, X:-10
a.
Develop a block plan using the algorithm you
learn in the class. Then calculate normalized
adjacency score for your layout.
13
Example 3
A college office building has five departments: A (accounting office), B (bursar’s office), C (credit
department), D (data processing department), and E (educational support services). Paper forms are
routed for processing through these departments in the quantities and sequences indicated in the table
below.
a.
Construct symmetrical from-to-chart showing flows or number of trips between any pair of departments. (Note: in the symmetrical flow matrix,
consider total flows between pair of departments. For instance, from A to B plus from A to B shows total flow between A and B.
b.
Based on the data in the from-to-chart, develop the activity relationship chart for these five departments according to given information: “A” =
number of trips ≥ 50; “E” = number of trips = 35 to 49; “I” = number of trips = 20 to 34; “O” = number of trips = 1 to 19, and “U” = zero trips.
c.
Develop a block plan using the algorithm you learn in the class. Then calculate normalized adjacency score for your layout. For block plan, use
5x4 grid.
14
BLOCKPLAN SOFTWARE
15
Download