Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks

This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, minimizing the cycle time for the minimum number of workstations. In order to solve the problem we propose the use of a Greedy Randomized Adaptive Search Procedure (GRASP) obtained from the application of some classic heuristics, based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach.

• Type: Conference
• Year: 2000
• Where: ICRA
• Authors: Joaquín Bautista, Raúl Suárez, Manuel Mateo, Ramón Companys
• Keywords: Greedy Randomized Adaptive Search Procedure, ICRA 2000, Minimum Number, Problem Considering Incompatibilities, Robotics