14.2 Facility Layout Design and Flow Analysis

Facility layout design establishes the physical arrangement of equipment, workstations, storage areas, and material transport corridors within a plant or distribution center. An optimal layout minimizes material handling travel, reduces work-in-process (WIP) inventories, eliminates processing bottlenecks, and promotes worker safety. On the FE Industrial and Systems exam, facility layout questions cover the taxonomy of layout configurations, quantitative flow analysis (From-To charts), qualitative closeness evaluations (REL charts), Systematic Layout Planning (SLP), the Quadratic Assignment Problem (QAP), and computerized layout algorithms.

---

1. The Four Classical Facility Layout Types

Facility layouts are classified along the classic product-process continuum, balancing production volume against product variety:

Product-Process Volume-Variety Matrix
 Product Variety
     ^ 
High │  [Fixed-Position Layout]   [Process / Functional Layout]
     │  (Shipbuilding, Aircraft)   (Job Shops, Custom Machining)
     │
     │                            [Cellular / GT Layout]
     │                            (Group Technology Cells)
     │
Low  │                                                         [Product / Flow-Line]
     │                                                         (Automotive Assembly)
     └─────────────────────────────────────────────────────────────────────────────>
     Low                                                                       High
                                 Production Volume

1. Product Layout (Flow-Line / Assembly Line)

In a product layout, workstations and equipment are arranged in the exact linear sequence dictated by the operations required to manufacture the product. Materials flow continuously along a fixed path (typically driven by powered conveyors).

• Operational Characteristics: High volume, low variety, highly standardized products (e.g., automotive assembly lines, consumer electronics, beverage bottling plants).
• Advantages: Low per-unit variable cost, minimal WIP inventory buffers, rapid cycle times, simplified production scheduling, low material handling distance per part.
• Disadvantages: Massive initial capital investment, extreme inflexibility to product redesign, high vulnerability to line stoppage (a single machine breakdown halts the entire production line).

2. Process Layout (Functional Layout / Job Shop)

In a process layout, machines and operations performing similar functions are grouped together into dedicated departments (e.g., all lathes in a turning department, all milling machines in a milling department, separate heat treatment and welding bays).

• Operational Characteristics: Low volume, high variety, customized products (e.g., commercial machine shops, custom fabrication, hospital wings, maintenance facilities).
• Advantages: High flexibility to handle diverse product routings, low risk of equipment obsolescence, robust to individual equipment breakdowns (work is simply rerouted to another machine).
• Disadvantages: High material handling costs, large WIP inventory accumulations, long and variable manufacturing lead times, complex production control and scheduling.

3. Cellular Layout (Hybrid / Group Technology)

A cellular layout groups dissimilar machines into dedicated work cells to process a specific part family—a collection of parts sharing similar geometries, manufacturing routings, or tooling requirements.

• Operational Characteristics: Moderate volume, moderate variety. Often configured in U-shaped cells.
• Advantages: Combines the high flexibility of a process layout with the low WIP and streamlined flow of a product layout; enables single-minute exchange of die (SMED) setup reductions; facilitates multiskilled cross-trained operators.
• Design Methodologies: Rank Order Clustering (ROC), Production Flow Analysis (PFA).

4. Fixed-Position Layout (Project Layout)

In a fixed-position layout, the product remains stationary at a single location due to its massive physical size, extreme weight, or fragility. Equipment, tooling, raw materials, and skilled labor are brought directly to the product site.

• Operational Characteristics: Very low volume (often single units), highly unique projects (e.g., shipbuilding, commercial aircraft construction, bridge fabrication, home construction).
• Advantages: Highly adaptable to custom design changes; avoids moving massive physical structures during fabrication.
• Disadvantages: Severe physical site congestion, complex project scheduling (CPM/PERT), low utilization of specialized machinery.

Comprehensive Comparison Matrix

---

2. Flow Analysis Tools: From-To Charts and REL Charts

Industrial engineers utilize quantitative flow matrices when material movement is measurable, and qualitative relationship charts when interactions involve subjective, organizational, or environmental factors.

Quantitative Flow: The From-To Chart (Trip Frequency Matrix)

A From-To Chart is a square matrix $F = [f_{ij}]$ where entry $f_{ij}$ represents the volume, weight, or number of material handling trips moving from department $i$ to department $j$ over a defined operational timeframe.

• Diagonal Elements: $f_{ii} = 0$ (no internal transport).
• Asymmetry: Flows are generally asymmetric ($f_{ij} \neq f_{ji}$). For example, raw castings move from receiving to machining, but do not move backwards.
• Two-Way Total Flow: If material handling cost per trip is independent of direction, the total interaction between department $i$ and department $j$ is the sum of flows in both directions: $f_{ij} + f_{ji}$.

Qualitative Flow: Activity Relationship Chart (REL Chart)

When material flows cannot be quantified (e.g., service departments, administrative offices, shared maintenance cribs, safety separation), engineers construct an Activity Relationship Chart (REL Chart), developed by Richard Muther.

Activity Relationship (REL) Closeness Rating Scale
 Rating │ Closeness Meaning       │ Color Code │ Normalized Weight │ Line Code
 ───────┼─────────────────────────┼────────────┼───────────────────┼──────────
   A    │ Absolutely Necessary    │ Red        │      6 (or 4)     │ 4 Lines (════)
   E    │ Especially Important    │ Yellow     │      5 (or 3)     │ 3 Lines (────)
   I    │ Important               │ Green      │      4 (or 2)     │ 2 Lines (----
   O    │ Ordinary Closeness      │ Blue       │      3 (or 1)     │ 1 Line  (····)
   U    │ Unimportant             │ Uncolored  │      0            │ No Line
   X    │ Undesirable             │ Brown      │     -6 (or -4)    │ Squiggly (~~~~)

• Standard Closeness Ratings:
  • A (Absolutely Necessary): Highest proximity priority (e.g., shared heavy crane, direct continuous piping, high-frequency physical records exchange).
  • E (Especially Important): High interaction (e.g., frequent supervisory contact, shared testing equipment).
  • I (Important): Regular operational connection (e.g., shared maintenance personnel, common utility lines).
  • O (Ordinary Closeness): Routine contact; acceptable to place nearby if space permits.
  • U (Unimportant): No meaningful relationship; placement relative to one another is indifferent.
  • X (Undesirable): Separation is mandatory due to safety hazards, acoustic noise, vibration, airborne chemical fumes, explosion risk, or cleanroom contamination (e.g., foundry sand molding placed next to optical inspection).

---

3. Muther's Systematic Layout Planning (SLP) Procedure

Developed by Richard Muther, Systematic Layout Planning (SLP) is the universally accepted engineering framework for synthesizing quantitative flow data and qualitative relationship charts into optimized block layouts.

Systematic Layout Planning (SLP) Procedure
 ┌──────────────────────────────────────────────────────────┐
 │ 1. Input Data: P (Product), Q (Quantity), R (Routing),   │
 │                S (Supporting Services), T (Time)         │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌────────────────────────────┴─────────────────────────────┐
 │ 2. Analyze Flow of Materials (From-To)                   │
 │    & Activity Relationships (REL Chart)                  │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 3. Construct Relationship Diagram (Nodal string graph)   │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 4. Determine Space Requirements (Equipment + Aisles)     │
 │    & Match Against Space Available                       │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 5. Develop Space Relationship Diagram (Scaled blocks)    │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 6. Apply Modifying Considerations & Practical Limits     │
 │    (Columns, floor loading, safety codes, docks)         │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 7. Generate & Evaluate Layout Alternatives               │
 │    (Multi-criteria scoring, material handling cost)      │
 └────────────────────────────┬─────────────────────────────┘
                              ▼
 ┌──────────────────────────────────────────────────────────┐
 │ 8. Select & Implement Optimal Detailed Layout            │
 └──────────────────────────────────────────────────────────┘

---

4. Mathematical Formulation: The Quadratic Assignment Problem (QAP)

The formal mathematical optimization model for facility layout is the Quadratic Assignment Problem (QAP), first formulated by Koopmans and Beckmann (1957). The objective is to assign $n$ departments to $n$ predefined physical locations so that total material handling transport cost is minimized.

Mathematical Model

Let:

• $f_{ij}$ = material flow from department $i$ to department $j$
• $c_{ij}$ = material handling cost per unit flow per unit distance between department $i$ and $j$
• $d_{kl}$ = distance between physical location $k$ and physical location $l$
• $x_{ik}$ = binary decision variable where $x_{ik} = 1$ if department $i$ is assigned to location $k$, and $0$ otherwise

$\min \sum_{i=1}^n \sum_{j=1}^n \sum_{k=1}^n \sum_{l=1}^n f_{ij} \, c_{ij} \, d_{kl} \, x_{ik} \, x_{jl}$

$\text{Subject to:}$ $\sum_{k=1}^n x_{ik} = 1 \quad \forall i=1, \dots, n \quad \text{(each department assigned to exactly one location)}$ $\sum_{i=1}^n x_{ik} = 1 \quad \forall k=1, \dots, n \quad \text{(each location receives exactly one department)}$ $x_{ik} \in \{0, 1\} \quad \forall i, k$

Computational Complexity and NP-Hardness

The QAP objective contains the quadratic product of two decision variables ($x_{ik} \cdot x_{jl}$). This model is NP-hard. For $n$ departments, there are $n!$ possible assignment permutations. For $n = 10$, $n! = 3,628,800$ permutations (solvable); for $n = 20$, $n! \approx 2.43 \times 10^{18}$ permutations (computationally intractable via exact enumeration). Consequently, industrial engineers rely on computerized heuristic algorithms to generate high-quality practical solutions.

---

5. Computerized Layout Algorithms: CRAFT, CORELAP, and ALDEP

Computerized layout packages fall into two fundamental algorithmic architectures:

Computerized Layout Algorithms
 ├── Improvement Algorithms (Require an initial layout, iteratively swap departments)
 │    └── CRAFT (Computerized Relative Allocation of Facilities Technique)
 └── Construction Algorithms (Build layout from scratch using relationship matrices)
      ├── CORELAP (Computerized Relationship Layout Planning)
      └── ALDEP (Automated Layout Design Program)

CRAFT (Computerized Relative Allocation of Facilities Technique)

• Algorithm Type: Improvement algorithm. CRAFT requires an initial starting layout, a From-To flow matrix, unit transport cost matrix, and department area specifications.
• Search Mechanics: Evaluates pairwise (2-way) or three-way exchanges of departments. To be eligible for exchange, departments must either be spatially adjacent or share identical surface areas.
• Distance Calculation: Distance $d_{kl}$ is measured as the rectilinear distance between department centroids.
• Convergence: CRAFT calculates the cost reduction for all eligible swaps, executes the exchange yielding the steepest cost reduction, updates department centroids, and repeats. The algorithm terminates when no exchange improves the cost, reaching a local optimum (not guaranteed to be globally optimal).
• Shape Distortion: Departments in CRAFT can split or evolve into irregular, non-rectangular "banded" geometries, requiring manual smoothing by the industrial engineer.

CORELAP (Computerized Relationship Layout Planning)

• Algorithm Type: Construction algorithm. Builds a block layout from scratch without requiring an initial starting layout.
• Input Data: Qualitative Activity Relationship Chart (REL chart) and department area requirements.
• Total Closeness Rating (TCR): For each department $i$, CORELAP calculates a composite rating summing its relationship scores with all other departments: $\text{TCR}_i = \sum_{j \neq i} \text{Score}(r_{ij})$ using standard numerical weights ($A = 6, E = 5, I = 4, O = 3, U = 0, X = -6$).
• Placement Logic: The department with the highest TCR is placed first in the center of the layout grid. Subsequent departments are selected based on the highest relationship rating with already-placed departments, positioning them adjacent to maximize boundary contact.

ALDEP (Automated Layout Design Program)

• Algorithm Type: Construction algorithm.
• Input Data: REL chart, department areas, and a user-specified sweep width.
• Placement Logic: Randomly selects the first department. It scans the REL chart for an unplaced department having an 'A' relationship with the placed department. If none exists, it looks for 'E', then 'I'. If no strong relationship is found, it selects an unplaced department at random.
• Grid Layout Generation: Places departments along a vertical continuous "serpentine" (snake-like) sweeping path using the designated sweep width.

---

6. Step-by-Step Worked Engineering Calculations

Worked Example 14.2.1: Material Handling Cost Optimization Using From-To Chart and Distance Matrix

Problem: A small manufacturing cell consists of three departments: Milling (M), Drilling (D), and Grinding (G). The facility has three linearly arranged bays (Location 1, Location 2, Location 3) spaced 15 meters apart center-to-center along an automated cart line ($d_{1,2} = 15\text{ m}, d_{2,3} = 15\text{ m}, d_{1,3} = 30\text{ m}$).

The daily trip frequencies between departments are:

• From M to D: $40\text{ trips/day}$; From D to M: $0\text{ trips/day}$
• From M to G: $10\text{ trips/day}$; From G to M: $0\text{ trips/day}$
• From D to G: $50\text{ trips/day}$; From G to D: $10\text{ trips/day}$

Material handling cost is uniform at $$0.50$ per meter-trip. Compare two proposed layouts:

• Layout 1 (M-D-G): M at Loc 1, D at Loc 2, G at Loc 3
• Layout 2 (M-G-D): M at Loc 1, G at Loc 2, D at Loc 3

Determine which layout minimizes total daily material handling cost and calculate the daily savings.

Solution:

Step 1: Compute Two-Way Total Daily Trip Frequencies

• M and D: $f_{MD} + f_{DM} = 40 + 0 = 40\text{ trips/day}$
• M and G: $f_{MG} + f_{GM} = 10 + 0 = 10\text{ trips/day}$
• D and G: $f_{DG} + f_{GD} = 50 + 10 = 60\text{ trips/day}$

Step 2: Evaluate Total Distance and Cost for Layout 1 (M at 1, D at 2, G at 3)

• Distance M to D: $d_{1,2} = 15\text{ m}$
• Distance M to G: $d_{1,3} = 30\text{ m}$
• Distance D to G: $d_{2,3} = 15\text{ m}$

$\text{Daily Distance}_1 = (40)(15) + (10)(30) + (60)(15) = 600 + 300 + 900 = 1,800\text{ meter-trips/day}$ $\text{Daily Cost}_1 = 1,800\text{ m-trips} \times \$0.50/\text{m-trip} = \$900.00/\text{day}$

Step 3: Evaluate Total Distance and Cost for Layout 2 (M at 1, G at 2, D at 3)

• Distance M to G: $d_{1,2} = 15\text{ m}$
• Distance M to D: $d_{1,3} = 30\text{ m}$
• Distance G to D: $d_{2,3} = 15\text{ m}$

$\text{Daily Distance}_2 = (10)(15) + (40)(30) + (60)(15) = 150 + 1,200 + 900 = 2,250\text{ meter-trips/day}$ $\text{Daily Cost}_2 = 2,250\text{ m-trips} \times \$0.50/\text{m-trip} = \$1,125.00/\text{day}$

Step 4: Calculate Comparative Daily Savings $\text{Daily Savings} = \$1,125.00 - \$900.00 = \$225.00/\text{day}$ $\text{Annual Savings (250 operational days)} = 250 \times \$225.00 = \$56,250.00/\text{year}$

Conclusion: Layout 1 (M-D-G) is superior, reducing material transport by 450 meter-trips/day and saving $$225.00$ per day compared to Layout 2.

---

Worked Example 14.2.2: CORELAP Total Closeness Rating (TCR) and Placement Sequence

Problem: An industrial engineer is laying out four departments using the CORELAP construction heuristic: Receiving (1), Machining (2), Assembly (3), and Shipping (4). The Activity Relationship Chart (REL chart) ratings are recorded below:

• Department 1 to Department 2: A
• Department 1 to Department 3: U
• Department 1 to Department 4: X
• Department 2 to Department 3: E
• Department 2 to Department 4: I
• Department 3 to Department 4: A

Using standard CORELAP scoring weights ($A = 6, E = 5, I = 4, O = 3, U = 0, X = -6$):

1. Calculate the Total Closeness Rating (TCR) for each department.
2. Identify which department must be placed first in the center of the layout.

Solution:

Step 1: Set Up the Closeness Rating Matrix

Step 2: Calculate TCR for Each Department (Sum Across Row)

• $\text{TCR}_1 = 6 + 0 + (-6) = 0$
• $\text{TCR}_2 = 6 + 5 + 4 = 15$
• $\text{TCR}_3 = 0 + 5 + 6 = 11$
• $\text{TCR}_4 = (-6) + 4 + 6 = 4$

Step 3: Determine Initial Placement

• Ranking by TCR: Department 2 ($\text{TCR} = 15$) > Department 3 ($\text{TCR} = 11$) > Department 4 ($\text{TCR} = 4$) > Department 1 ($\text{TCR} = 0$).

Conclusion: Department 2 (Machining) has the highest Total Closeness Rating ($\text{TCR}_2 = 15$) and is selected as the first department placed in the layout.

---

7. NCEES Reference Handbook Tips & Realistic Exam Traps

• Improvement vs. Construction Trap: CRAFT is an improvement algorithm; it cannot generate a layout from scratch and requires an existing initial configuration. CORELAP and ALDEP are construction algorithms that build layouts from scratch without needing a starting layout.
• Centroid Distance in CRAFT: CRAFT calculates transport cost using the rectilinear distance between department centroids, NOT perimeter-to-perimeter or doorway-to-doorway distances. If an exam problem asks why CRAFT might overestimate travel between adjacent departments sharing an open common wall, the answer is centroid-to-centroid measurement.
• Symmetric vs. Asymmetric Flow Trap: When evaluating material handling costs with uniform two-way transport equipment (e.g., forklifts carrying loads in both directions), ensure you sum both directions: $f_{ij} + f_{ji}$. If an exam table shows $f_{12} = 30$ and $f_{21} = 20$, the total interaction volume is $50$ trips.
• The Undesirable 'X' Rating: In REL chart problems, remember that an 'X' rating carries a negative weight (e.g., $-6$). If two departments with an 'X' rating are placed adjacent, the algorithm incurs a severe penalty. An 'X' rating does NOT mean "unknown" or "no data"—it means proximity is actively hazardous.