16
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

Technical note: Tabu search heuristic for a loading problem in flexible manufacturing systems

Pages 1171-1174 | Published online: 25 Jun 2007
 

Abstract

This note presents an improvement algorithm for a flexible manufacturing systems (FMS) loading problem. The tabu meta-heuristic is used in conjunction with this algorithm. Previous authors have proposed integer programming, Lagrangean relaxation heuristic, and branch and bound search to solve this problem. Computational comparison between the improvement algorithm and the branch and bound search algorithm is presented.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.