A one-step tabu search algorithm for manufacturing cell design

A one-step tabu search algorithm for manufacturing cell design

0.00 Avg rating0 Votes
Article ID: iaor20002021
Country: United Kingdom
Volume: 50
Issue: 5
Start Page Number: 509
End Page Number: 516
Publication Date: May 1999
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: heuristics
Abstract:

As part of the cellular manufacturing design process, machines must be grouped in cells and the corresponding part families must be assigned. Limits on both the number of machines per cell and the number of parts per family can be considered. A weighted sum of intracell voids and intercellular moves is used to evaluate the quality of the solutions. We present a tabu search algorithm that systematically explores feasible machine cells configurations determining the corresponding part families using a linear network flow model. The performance of this tabu search is benchmarked against two simulated annealing approaches, another tabu search approach and three heuristics (ZODIAC, GRAFICS and MST).

Reviews

Required fields are marked *. Your email address will not be published.