Illustrate the heuristic procedures considering a case where four machines $($A$,$ B$,$ C$,$ D$)$ are to

be placed in four locations $(1,2,3,4)$ of a job shop. The number of trips per day between ma$-$

chines and the distances between locations are expressed by the symmetric matrices W and D$,$

respectively.