Development of a Tabu Search Algorithm for the Assembly Line Balancing Problem

摘要

In the following different Tabu Search procedures have been searched to reach a good efficiency in the solution of the assembly line problem problem. In particular the possibility of having stochastic times of tasks completion and tasks paralleling in a workstation is considered. Paralleling means that task assigned to a workstation can be shared between more workmen. Considering Lean Simulation paradigms, it is important, to use Modelling and Simulation with effective procedures that can speed up simulation outputs in a particular field of application. Aim of present paper is also to investigate the effectiveness of using TS for the Assembly Line Balancing problem from Lean Simulation point of view. Some implementation issues are discussed such as: the search process of new solutions, initial solutions construction, objective functions used. referring, in particular to the objective functions used. In the final part results of the algorithms are shown and commented.