ILS Algorithm for the Assembly Line Balancing Problem

This work addresses the application of the Iterated Local Search (ILS) algorithm to solve the Simple Assembly Line Balancing Problem Type 2 (SALBP-2). The main objective of SALBP-2 is to distribute tasks among workstations in a balanced manner while respecting precedence constraints between tasks and minimizing cycle time. By applying ILS to SALBP-2 results close to the best-known results in the literature were obtained. The values obtained are also compared with the results of another work in the literature. At the end of the computational experiments, it was found that the values obtained by ILS were, respectively, 3.10% and 1.83% away from the best known results and in relation to a GRASP algorithm proposed in the literature for SALBP-2.