Philipp Hungerländer

A computational study and survey of methods for the single-row facility layout problem

The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular departments so as to minimize the overall interaction cost. This paper compares the different modelling approaches for (SRFLP) and applies a recent SDP approach for general quadratic ordering problems from Hungerländer and Rendl to (SRFLP). In particular, we report optimal solutions for several (SRFLP) instances from the literature with up to 42 departments that remained unsolved so far. Secondly we significantly reduce the best known gaps and running times for large instances with up to 110 departments.

Semidefinite relaxations of ordering problems

Ordering problems assign weights to each ordering and ask to find an ordering of maximum weight. We consider problems where the cost function is either linear or quadratic. In the first case, there is a given profit if the element

Single-row equidistant facility layout as a special case of single-row facility layout

u

Multi-level Verticality Optimization: Concept, Strategies, and Drawing Scheme

is before

The traveling salesman problem on grids with forbidden neighborhoods

v

Solution Approaches for the Double-Row Equidistant Facility Layout Problem

in the ordering. In the second case, the profit depends on whether