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. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-04918-7_1 | Hybrid Metaheuristics |
Keywords | Field | DocType |
computational result,hybrid method,sheltered work,iterated local search,local search heuristics,assembly line worker assignment,hybrid metaheuristic,operation time,search space,balancing problem,real assembly line,local search | Mathematical optimization,Guided Local Search,Beam search,Heuristics,Local search (optimization),Cluster analysis,Tabu search,Iterated local search,Mathematics,Metaheuristic | Conference |
Volume | ISSN | Citations |
5818 | 0302-9743 | 19 |
PageRank | References | Authors |
1.06 | 5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Antonio Augusto Chaves | 1 | 116 | 10.24 |
Luiz Antonio Nogueira Lorena | 2 | 498 | 36.72 |
Cristobal Miralles | 3 | 55 | 2.37 |