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

2002 ◽  
Author(s):  
J. Bautista ◽  
R. Suarez ◽  
M. Mateo ◽  
R. Companys
Keyword(s):  
Local Search ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Local Search Heuristics ◽  
Search Heuristics ◽  
Assembly Line Balancing Problem

Stochastic Local Search for Solving Chance-Constrained Multi-Manned U-shaped Assembly Line Balancing Problem with Time and Space Constraints

2021 ◽  
Vol 23 (04) ◽  
pp. 278-295
Author(s):  
Mohammad Zakarai ◽  
◽  
Hegazy Zaher ◽  
Naglaa Ragaa ◽  
◽  
...  
Keyword(s):  
Local Search ◽  
Assembly Line ◽  
Search Algorithm ◽  
Assembly Line Balancing ◽  
Fixed Number ◽  
Line Balancing ◽  
Benchmark Problems ◽  
Stochastic Local Search ◽  
Time And Space ◽  
Assembly Line Balancing Problem

The assembly line balancing problems have great importance in research and industry fields. They allow minimizing the learning aspects and guaranteeing a fixed number of products per day. This paper introduces a new problem that combines the multi-manned concept with the U-shaped lines with time and space constraints under uncertainty. The processing time of the tasks is considered as random variables with known means and variances. Therefore, chance-constraints appear in the cycle time constraints. In addition, each task has an associated area, where the assigned tasks per station are restricted by a total area. The proposed algorithm for solving the problem is a stochastic local search algorithm. The parameter levels of the proposed algorithm are optimized by the Taguchi method to cover the small, medium, and large-sized problems. Well-known benchmark problems have been adapted to cover the new model. The computational results showed the importance of the new problem and the efficiency of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document