Illustrating the pairwise layout improvement algorithm and establishing lower bounds
Suppose four machines are to be placed in a job shop. The from-to flow matrix, F, for the machines (labeled A through D), and the distance matrix, D, for the four sites (numbered 1 through 4) are given as follows:
Flow Matrix (F) | Distance Matrix (D) | |||||||||
A | B | C | D | 1 | 2 | 3 | 4 | |||
A | — | 5 | 2 | 0 | 1 | — | 5 | 10 | 4 | |
B | 0 | — | 2 | 3 | 2 | 4 | — | 6 | 7 | |
C | 3 | 4 | — | 0 | 3 | 8 | 5 | — | 5 | |
D | 0 | 0 | 5 | — | 4 | 6 | 6 | 5 | — |