One-dimensional machine location problems in a multi-product flowline with equidistant locations

• Published in: European journal of operational research Vol. 105; no. 3; pp. 401 - 426
• Main Authors: Sarker, Bhaba R., Wilhelm, Wilbert E., Hogg, Gary L.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 16.03.1998; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Exact sciences and technology; Facilities; Flexible manufacturing systems; Flows in networks. Combinatorial problems; Heuristic; Heuristics; Inventory control, production control. Distribution; Location; Lower bound; Materials handling; Multi-product flowline; One-dimension; Operational research and scientific management; Operational research. Management science; Quadratic assignment problem; Studies; Multi-product flowline; Lower bound; Heuristics; Quadratic assignment problem; One-dimension; Facilities; Location; One dimensional model; Heuristic method; Production line; Quadratic assignment; Facility; Multiple production; Location problem; Machine
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/S0377-2217(97)00065-9

An assignment of machines to locations along a straight track is required to optimize material flow in many manufacturing systems. The assignment of M unique machines to M locations along a linear material handling track with the objective of minimizing the total machine-to-machine material transportation cost is formulated as a quadratic assignment problem (QAP). The distance matrix in problems involving equally-spaced machine locations in one dimension is seen to possess some unique characteristics called amoebic properties. Since an optimal solution to a problem with large M is computationally intractable (the QAP is NP-hard), a number of the amoebic properties are exploited to devise heuristics and a lower bound on the optimal solution. Computational results which demonstrate the performance of the heuristics and the lower bound are presented.