Locating sets of identical machines in a linear layout

摘要: The assignment of M unique machines to locations with the objective minimizing total machine-to-machine material transportation cost in a flow line may be formulated as quadratic problem (QAP). Instead having machines, if an application involves one or more sets identical location becomes tertiary (TAP). Solving large this kind is extremely difficult because its combinatorial nature. When fixed, TAP specialized QAP for which machine special case. Obtaining optimum solution when also computationally intractable. However, solved by identifying partitioned into individual, "unique" machines. Properties type matrix called amoebic are used problems provide approximate solutions, relabeled prescribe original problem. Results demonstrated along suggestions further research.