View Item 

A tabu search for multi-objective single row facility layout problem

Access Status
Open access
Authors
Lenin, N.
Siva Kumar, M.
Ravindran, D.
Islam, Mohammad Nazrul
Date
2014
Type
Journal Article

Metadata
Show full item record
Citation
Lenin, N. and Siva Kumar, M. and Ravindran, D. and Islam, M.N. 2014. A tabu search for multi-objective single row facility layout problem. Journal of Advanced Manufacturing Systems. 13 (1): pp. 17-40.
Source Title
Journal of Advanced Manufacturing Systems
DOI
ISSN
School
Department of Mechanical Engineering
Remarks

Electronic version of an article published in Journal of Advanced Manufacturing Systems, 2014, 13 (1): pp. 17-40. DOI: 10.1142/S0219686714500024. © copyright World Scientific Publishing Company

URI
Collection
Abstract

This paper addresses the problem of multi objective facility layout planning. The aim is to solve the single row facility layout problems (SRFLP) and find the linear machine sequence which minimizes the following: the total investment cost of machines; the total material handling cost; the total number of machines in the final sequence; and the total flow distance of the products in units. The tabu search algorithm (TSA) which has now become a very useful tool in solving a variety of combinatorial optimization problems is made use of here. TSA is developed to determine the product sequence based on which a common linear machine sequence is found out for multi-products with different machine sequences. We assume that, limited number of duplicate machine types available for job. The results are compared with other approaches and it shows the effectiveness of the TSA approach as a practical decision support tool to solve problems in SRFLP.