Scheduling a flow-line maufacturing cell: A tabu search approach

Scheduling a flow-line maufacturing cell: A tabu search approach

0.00 Avg rating0 Votes
Article ID: iaor1994601
Country: United Kingdom
Volume: 31
Issue: 7
Start Page Number: 1721
End Page Number: 1734
Publication Date: Jul 1993
Journal: International Journal of Production Research
Authors: ,
Keywords: tabu search
Abstract:

The performance of two heuristic procedures for the scheduling of a flow-line manufacturing cell was compared. The authors propose a procedure based on a combinatorial search technique known as tabu search. The new procedure is compared with a heuristic based on simulated annealing which was proposed in earlier research. The scheduling problem addressed here differs from the traditional flow-shop scheduling problem in the sense that the authors are interested in sequencing part families (i.e. groups of jobs which share a similar setup) as well as individual jobs within each family. The results reveal that the tabu search heuristics outperforms the simulated annealing heuristic by generating ‘better solutions’ in less computation time.

Reviews

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