23-Ind-A3 Facilities Planning · May 2015
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
National Exams — May 2015 — 98-Ind-A3 Facilities Planning. Three-hour, closed-book exam (Casio or Sharp approved calculator only); any five of the seven questions constitute a complete paper and only the first five answered in the answer book are marked — all seven are solved below for completeness.
Reference texts: Tompkins, White, Bozer & Tanchoco, Facilities Planning (4th ed., Wiley) — the facilities-planning hierarchy, the facilities planning process, layout types, computer-integrated manufacturing and automated storage/retrieval, machine space requirements, Muther's Systematic Layout Planning (SLP) procedure, computerized layout algorithms (CRAFT/CORELAP), and material handling equipment; Niebel & Freivalds, Niebel’s Methods, Standards, and Work Design (13th ed.) — assembly-line balancing (Ranked Positional Weight technique), buffer/decoupling design, operator-paced line speed, JIT and lean/waste-elimination concepts.
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Given. Operator performance rating $\sim N(\mu=100\%,\ \sigma)$; stated range 60%–140% (taken as $\mu\pm3\sigma$); $Z=1.04$ for the 85th/15th percentile.
Find. (a) the station speed (as a % of average) the paced line must be set to if it is to accommodate the operator at the 15th percentile of the performance distribution (i.e. the operator whom 85% of the workforce out-paces — described in the question as "85% of average"); (b) the gain in station speed if the line is instead decoupled and set for the average (100%) operator.
Approach. Derive $\sigma$ from the stated range, then use the given $Z=1.04$ to find the performance rating at the 15th percentile (the operator a synchronous/paced line must be set for so that only the slowest 15% of the workforce cannot keep pace); compare that rating to the 100% average rating to get the decoupled-line gain.
| Quantity | Result |
|---|---|
| $\sigma$ of the performance distribution | 13.33% |
| (a) Paced-line station speed (15th-percentile operator) | 86.13% of average |
| (b) Gain from decoupling & setting for the average operator | 13.87 points (16.1% faster) |
CRAFT (Computerized Relative Allocation of Facilities Technique) is an improvement-type (also called improvement/heuristic) computerized layout algorithm. It starts from a user-supplied INITIAL layout (an existing layout, or an initial guess) together with a from–to flow matrix and a cost/distance matrix, then evaluates pairwise (2-way or 3-way) interchanges of department locations, accepting an interchange whenever it reduces total material-handling cost ($\sum f_{ij}c_{ij}d_{ij}$), and continues until no further interchange improves the objective (a local-search/steepest-descent heuristic). Because it only swaps departments of roughly compatible area (it does not freely reshape department boundaries beyond swapping), CRAFT can produce impractical, non-rectangular department shapes that a human planner must clean up; it also, being a local-search method, can converge to a local rather than global optimum, so the quality of its result is sensitive to the quality of the starting layout supplied.
CORELAP (Computerized Relationship Layout Planning) is a construction-type algorithm — it builds a layout from scratch rather than improving a given one. Its input is the qualitative activity-relationship (REL) chart (the A-E-I-O-U-X closeness ratings and reason codes), not a quantitative from–to flow matrix. CORELAP computes a Total Closeness Rating (TCR) for each department (a weighted sum of its relationship codes with every other department) and places departments into the layout one at a time in decreasing order of TCR, each new department positioned to best satisfy its closeness relationships with the departments already placed. Because it works from qualitative relationship data, CORELAP is well suited to situations where the desired adjacencies are known but numeric flow volumes are not (or are not the dominant siting criterion, e.g., where supervision, safety or shared-service adjacency matters as much as flow); like CRAFT, though, it is a heuristic and does not guarantee a globally optimal layout.
To lay out a facility handling multiple products/items, a computerized layout program needs, at minimum: (1) a defined set of departments/activities and their space requirements (Question 3(i)/(ii)); (2) a quantitative interaction measure between every pair of departments — either a from–to flow/cost matrix (as CRAFT requires) or a qualitative relationship chart (as CORELAP requires) — that aggregates the flow or closeness need across ALL items/products handled, not just one; (3) a building/site outline or area constraint within which the departments must fit; (4) an objective function (typically minimize total material handling cost, or maximize weighted closeness satisfaction) that the algorithm can evaluate and improve against; (5) a starting layout (for improvement-type algorithms like CRAFT) or a placement rule (for construction-type algorithms like CORELAP); and (6) the ability to respect physical/fixed-location constraints (fixed-position equipment, building columns, docks) that cannot be relocated by the algorithm. Because these programs optimize a single aggregated objective across the full department set, when multiple items/products are handled their individual flow volumes (or relationship needs) must first be combined into ONE composite interaction matrix — this aggregation step, and the choice of relative weighting between products, is itself a modeling decision that materially affects the resulting layout.