Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem

Authors:
Antonio Augusto Chaves;Luiz Antonio Lorena;Cristobal Miralles
Affiliations:
Laboratory of Computing and Applied Mathematics, National Institute for Space Research, São José dos Campos, Brazil;Laboratory of Computing and Applied Mathematics, National Institute for Space Research, São José dos Campos, Brazil;ROGLE-Departamento Organización de Empresas, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Year:
2009

Citing 5
Cited 4

A survey of exact algorithms for the simple assembly line balancing problem

Management Science
Variable neighborhood search

Computers and Operations Research
Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled

Discrete Applied Mathematics
Evolutionary clustering search for flowtime minimization in permutation flow shop

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Hybrid metaheuristic for the prize collecting travelling salesman problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

On solving the assembly line worker assignment and balancing problem via beam search

Computers and Operations Research
Simple heuristics for the assembly line worker assignment and balancing problem

Journal of Heuristics
An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II

Computers and Operations Research
A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Assembly Line Worker Assignment and Balancing Problem (ALWABP) appears in real assembly lines which we have to assign given tasks to workers where there are some task-worker incompatibilities and considering that the operation time for each task is different depending upon who executes the task. This problem is typical for Sheltered Work Centers for the Disabled and it is well known to be NP-Hard. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the ALWABP. The CS identifies promising regions of the search space by generating solutions with a metaheuristic, such as Iterated Local Search, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of the CS.