Sciweavers

Share
ICRA
2000
IEEE

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

9 years 6 months ago
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.
Joaquín Bautista, Raúl Suárez
Added 31 Jul 2010
Updated 31 Jul 2010
Type Conference
Year 2000
Where ICRA
Authors Joaquín Bautista, Raúl Suárez, Manuel Mateo, Ramón Companys
Comments (0)
books