One-dimensional machine location problems in a multi-product flowline with equidistant locations |
| |
Institution: | 1. University of Tunis El Manar, Faculty of Sciences of Tunis, Laboratory of Materials, Crystal Chemistry and Applied Thermodynamics, 2092 El Manar II, Tunis, Tunisia;2. The Higher Institute of Preparatory Studies in Biology and Geology (ISEP-BG) of Soukra, 49 Avenue “August 13” Choutrana II-2036 Soukra, Tunisia, Carthage University, Tunisia |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|