Tabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach

Wen-Chyuan Chiang

This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly line problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.