Local search heuristics for the assembly line balancing problem with incompatibilities between tasks

Author

Bautista, Joaquin ; Suarez, Raul ; Mateo, Manuel ; Companys, Ramón

Author_Institution

Inst. d´´Organitzacio i Control de Sistemes Ind., Univ. Politecnica de Catalunya, Barcelona, Spain

Volume

3

fYear

2000

fDate

2000

Firstpage

2404

Abstract

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 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

Keywords

assembly planning; genetic algorithms; production control; search problems; assembly line balancing; cycle time; genetic algorithm; greedy randomized adaptive search; incompatibility; local search heuristics; production control; search problem; Genetic algorithms; Humans; Industrial control; Industrial engineering; Rails; Robotic assembly; Robots; Search methods; Simulated annealing; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Robotics and Automation, 2000. Proceedings. ICRA '00. IEEE International Conference on

Conference_Location

San Francisco, CA

ISSN

1050-4729

Print_ISBN

0-7803-5886-4

Type

conf

DOI

10.1109/ROBOT.2000.846387

Filename

846387