$\backslash$table$[[$Figure $1.$ Interstation Activity Mix,,,,,,$],[,$Trips between processes,$],[$From:$,$A$,$B$,$C$,$D$,$E$,$F$],[$A$,-,16,27,75,10,56],[$B$,,-,96,23,30,46],[$C$,,,-,41,22,22],[$D$,,,,-,19,57],[$E$,,,,,-,48],[$F$,,,,,,-]]$

Based on the given flows between processes, one should ensure that processes $D$ and are in adjacent rooms as they have the third highest number of moves between each other. processes C$,$ D$,$ and E have been already determined. Using the "highest flow adjacent to each other" rule, work station $5$ should have:

Using the "highest flow adjacent to each other" rule, work station $1$ should have:

$\backslash$table$[[A,$D$,$E$,$B$,$C$]]$

Using the "highest flow adjacent to each other" rule, work station $3$ should have:

$\backslash$table$[[$A$,$D$,$F$,$E$,$B$,$C$]]$

whole number$).$