Facility layout planning
The standard layout problem that could also be modeled as a quadratic assignment
problem is considered. The main purpose of this module is to compute the costs
for different assignments of machines to locations. A simple 2-exchange procedure
is also implemented.
Six machines and locations are considered. If you want to consider a problem
with less machines, simply fill out the columns and rows that are not required
with zeros.
Symbols:
| i |
index of machines |
| Mi |
machine i |
A simple procedure for finding a good layout is the two-exchange
procedure, which can be manually performed in this module. Starting with
an arbitrary layout iteratively pair-wise exchanges are performed in a steepest-descent
way, as long as a cost reduction results.
Literature:
- Günther/Tempelmeier (1999), Abschnitt 5.2
|
