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

Authors:
Christian Blum;Cristobal Miralles
Affiliations:
ALBCOM Research Group, Universitat Politècnica de Catalunya, Barcelona, Spain;ROGLE - Dpto. Organización de Empresas, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Computers and Operations Research
Year:
2011

Citing 6
Cited 5

Assembly System Design: a Branch and Cut Approach

Management Science
Optimally balancing assembly lines with different workstations

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Branch and bound procedures for solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work centres for Disabled

Discrete Applied Mathematics
Beam search for the longest common subsequence problem

Computers and Operations Research
Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time

Computers and Industrial Engineering
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics

Reduction approaches for a generalized line balancing problem

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 branch-and-bound algorithm for assembly line worker assignment and balancing problems

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

Visualization

Abstract

Certain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is known as the assembly line worker assignment and balancing problem (ALWABP). This problem appears in settings where tasks must be assigned to workers, and workers to work stations. Task processing times are worker specific, and workers might even be incompatible with certain tasks. The ALWABP was introduced to model assembly lines typical for sheltered work centers for the Disabled. In this paper we introduce an algorithm based on beam search for solving the ALWABP with the objective of minimizing the cycle time when given a fixed number of work stations, respectively, workers. This problem version is denoted as ALWABP-2. The experimental results show that our algorithm is currently a state-of-the-art method for the ALWABP-2. In comparison to results from the literature, our algorithm obtains better or equal results in all cases. Moreover, the algorithm is very robust for what concerns the application to problem instances of different characteristics.