عنوان مقاله [English]
A special class of facility layout problem is the Single-Row Facility Layout Problem (SRFLP), which consists in finding a linear placement of rectangular facilities with varying dimensions on a straight line. In this research, we first prove a theorem to find the optimal solution of a special case of SRFLP. The theorems’ results are useful when a new algorithm, based on a tabu search, is presented for the SRFLP in this paper. Computational results of the proposed algorithm show the efficiency of the algorithm compared to other heuristics. The proposed algorithm can easily find near-optimal solutions for instances consisting of 200 departments in less than one minute. However, the largest instances reported to be solved by other methods had only 80 departments and took more than 10 hours to reach the solution.