Models For The Layout Problem
Models For The Layout Problem
Problem
Layout Problem
The objective is to minimize the cost or time in:
Man and material’s movement between offices
Transporting work in process, finished parts, materials, and tools
between machines or workstations
Picking parts from storage spaces
C
i 1 j i 1
ij f ij | xi x j |
subject to
1
| xi x j | (li l j ) d ij , i 1, 2, ..., n 1, j i 1, ..., n
2
Illustration of Parameters and Decision Variables
for the Single Row Layout Problem
d ij
li lj
Facility j
Facility i
xi
xj
VRL
ABSMODEL 1
If the building dimension is known and the
user wants to include the constraint that the
facilities are located within the horizontal
dimension, the constraint should be added :
1 1
H li xi li i 1, 2, ..., n
2 2
xj
xi
Facility i Facility j
...
H
li lj
VRL
Customer
Service
General Repair Part Display
Area Area
Room
1 2 3 4 5
1 - 12 8 20 0
Room
[ f ij ] 2 12 - 4 6 2
3 8 4 - 10 0
4 20 6 10 - 3
5 0 2 0 3 -
Room Dimensions
Room Name
Number (in feet)
1 TV/VCR 20 x 10
2 Audio 10 x 10
3 Microwave 10 x 10
4 Computer 20 x 10
5 Parts 15 x 10
Analysis of ABSMODEL 1 Using GINO
FINAL LAYOUT:[TVCR]
MODEL FOR THE MULTI-ROW
LAYOUT PROBLEM
The control panel layout problem; The machine
layout problem; Typewriter keyboard design; Office
layout (Burkard, 1984).
Various Models have been developed to formulate
the problem.
QAP (Quadratic Assignment Problem) –(Koopman
and Beckman, 1957)
Linear mixed integer programming (Love and Wong,
1976)
The quadratic set covering model (Bazaraa, 1975)
The non linear model (Heragu, 1992)
QAP
(Quadratic Assignment Problem)
n facilities to be assigned to m locations
Assignment means matching each facility
with a specific location and vice versa.
If m<n, use dummy (n-m) locations and
assign zero flow
If n<m, the problem is infeasible
QAP=Assignment Problem in which the
objective function is quadratic
Four sites, Four facilities and the
assignment of the facilities to the sites
1 2 a b b,1 d,2
3 4 c d c,3 a,4
Mathematical Model:[QAP]
Mathematical Model:[QAP]
Mathematical Model:[QAP]
QAP
Optimal algorithms: Branch and bound,
Decomposition, Cutting plane algorithms
These algorithms can produce optimal
solutions for only small sized problem
(M<=20)
Since it is computationally infeasible to find
an optimal solution when M>20.
Heuristic (non-optimal) procedures are used
to solve the problem – e.g. Steepest Descent
Pairwise Interchange (SDPI) Heuristic
EXAMPLE 2:LonBank Inc
Four square offices of equal area are to be
located in the new square building
Formulate the problem as a QAP using data in
Fig. 5.15
The site in the building are shown in Fig. 5.16
This problem is solved using GINO.
Inputs required by GINO
SOLUTION: LonBank Inc
ABSMODEL 2
ABSMODEL 1
The single-row facility layout problem
ABSMODEL 2
Two or more rows
Not even along straight rows
Facilities are squares of equal area
ABSMODEL 2
Assumptions:
No clearance between the facilities
The facilities have a unit dimension –length and
width are 1 unit each
Constraints:
(11) and (12) ensure that no facilities in the layout
overlap
ABSMODEL 2
Decision Variables and Reference
Lines –HRL & VRL
Decision Variables and Reference
Lines –HRL & VRL
SOLUTION:[Using GINO]
MODEL FOR THE MULTI-ROW LAYOUT PROBLEM WITH
FACILITIES OF UNEQUAL AREA
VM
2. Group machines
into cells based on
part families Worker 2
G
3. Arrange cells so
L
material movement
is minimized Final
inspection