2,777 research outputs found
On solving the assembly line worker assignment and balancing problem via beam search
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 characteristicsBlum, C.; Miralles Insa, CJ. (2011). On solving the assembly line worker assignment and balancing problem via beam search. Computers and Operations Research. 38(1):328-339. doi:10.1016/j.cor.2010.05.008S32833938
On solving the assembly line worker assignment and balancing problem via beam search
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 know 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. The experimental results show that our algorithm is currently a state-of-the-art method for this version of the ALWABP. 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.Postprint (published version
Simple heuristics for the assembly line worker assignment and balancing problem
We propose simple heuristics for the assembly line worker assignment and
balancing problem. This problem typically occurs in assembly lines in sheltered
work centers for the disabled. Different from the classical simple assembly
line balancing problem, the task execution times vary according to the assigned
worker. We develop a constructive heuristic framework based on task and worker
priority rules defining the order in which the tasks and workers should be
assigned to the workstations. We present a number of such rules and compare
their performance across three possible uses: as a stand-alone method, as an
initial solution generator for meta-heuristics, and as a decoder for a hybrid
genetic algorithm. Our results show that the heuristics are fast, they obtain
good results as a stand-alone method and are efficient when used as a initial
solution generator or as a solution decoder within more elaborate approaches.Comment: 18 pages, 1 figur
Iterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations
The simple assembly line balancing problem (SALBP) concerns the assignment of
tasks with pre-defined processing times to work stations that are arranged in a
line. Hereby, precedence constraints between the tasks must be respected. The
optimization goal of the SALBP-2 version of the problem concerns the
minimization of the so-called cycle time, that is, the time in which the tasks
of each work station must be completed.
In this work we propose to tackle this problem with an iterative search
method based on beam search. The proposed algorithm is able to obtain optimal,
respectively best-known, solutions in 283 out of 302 test cases. Moreover, for
9 further test cases the algorithm is able to produce new best-known solutions.
These numbers indicate that the proposed iterative beam search algorithm is
currently a state-of-the-art method for the SALBP-2
Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem
[EN] In robotic assembly lines, the task times depend on the robots assigned to each station. Robots are considered an unlimited resource and multiple robots of the same type can be assigned to different stations. Thus, the Robotic Assembly Line Balancing Problem (RALBP) consists of assigning a set of tasks and a type of robot to each station, subject to precedence constraints between the tasks. This paper proposes a lower bound, and exact and heuristic algorithms for the RALBP. The lower bound uses chain decomposition to explore the graph dependencies. The exact approaches include a novel linear mixed-integer programming model and a branch-bound-and-remember algorithm with problem-specific dominance rules. The heuristic solution is an iterative beam search with the same rules. To fully explore the different characteristics of the problem, we also propose a new set of instances. The methods and algorithms are extensively tested in computational experiments showing that they are competitive with the current state of the art. (C) 2018 Elsevier B.V. All rights reserved.Borba, L.; Ritt, M.; Miralles Insa, CJ. (2018). Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem. European Journal of Operational Research. 270(1):146-156. https://doi.org/10.1016/j.ejor.2018.03.011S146156270
Research Trends and Outlooks in Assembly Line Balancing Problems
This paper presents the findings from the survey of articles published on the assembly line balancing problems (ALBPs) during 2014-2018. Before proceeding a comprehensive literature review, the ineffectiveness of the previous ALBP classification structures is discussed and a new classification scheme based on the layout configurations of assembly lines is subsequently proposed. The research trend in each layout of assembly lines is highlighted through the graphical presentations. The challenges in the ALBPs are also pinpointed as a technical guideline for future research works
Profit-oriented disassembly-line balancing
As product and material recovery has gained importance, disassembly volumes have increased, justifying construction of disassembly lines similar to assembly lines. Recent research on disassembly lines has focused on complete disassembly. Unlike assembly, the current industry practice involves partial disassembly with profit-maximization or cost-minimization objectives. Another difference between assembly and disassembly is that disassembly involves additional precedence relations among tasks due to processing alternatives or physical restrictions. In this study, we define and solve the profit-oriented partial disassembly-line balancing problem. We first characterize different types of precedence relations in disassembly and propose a new representation scheme that encompasses all these types. We then develop the first mixed integer programming formulation for the partial disassembly-line balancing problem, which simultaneously determines (1) the parts whose demand is to be fulfilled to generate revenue, (2) the tasks that will release the selected parts under task and station costs, (3) the number of stations that will be opened, (4) the cycle time, and (5) the balance of the disassembly line, i.e. the feasible assignment of selected tasks to stations such that various types of precedence relations are satisfied. We propose a lower and upper-bounding scheme based on linear programming relaxation of the formulation. Computational results show that our approach provides near optimal solutions for small problems and is capable of solving larger problems with up to 320 disassembly tasks in reasonable time
- …