Space-Free Multi-Row Facility Layout problem (SF-MRFLP)

The Space-Free Multi-Row Facility Layout problem (SF-MRFLP) seeks for a non-overlapping layout of departments (facilities) on a given number of rows satisfying the following constraints: no space is allowed between two adjacent facilities and the left-most department of the arrangement must have zero abscissa. The objective is to minimize the total communication cost among facilities.

Instances and results

In order to favor future comparisons, we provide here both the instances used in the paper as well as the obtained results including cost and execution time.

K-page crossing number minimization problem

Alberto Herrán, J. Manuel Colmenar, Abraham Duarte

https://www.sciencedirect.com/science/article/abs/pii/S0950705120305050

The objective is to map a general graph into a book with exactly K pages, minimizing the number of edge crossings in each page. A particular solution of this problem is then obtained by placing the vertices of a graph along the spine and assigning the edges connecting the vertices to the different pages of the book.

Instances and results

In order to favor future comparisons, we provide here both the instances used in the paper as well as the obtained results including cost and execution time.