Adaptation of some Assembly Line Balancing Heuristics to a Mixed-Model Case

Abstract

This Master Thesis propose to find the best heuristic solution for one of the types of Assembly Line Balancing Problem, the SALP-1, in a line that needs to produce different models of the same product (mixed-model). That objective was tried to achieve by adapting some of the best algorithms for simple lines (Boctor, Helgeson & Birnie and Bedworth & Bailey) to solve that mixed-models. To solve the problem it will be probe some rules or make some changes in the problem in order to apply those algorithms. At least the objective is to study with what algorithm and whit which changes in the problem we obtain the better results.