Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
710132 | IFAC-PapersOnLine | 2016 | 5 Pages |
Abstract
This research presents an iterated local search (ILS) based technique to address the dynamic assembly line rebalancing problem. The goal is to find a new assignment of tasks to workstations when disturbances occur. The solution must respect a desired cycle time (takt time) and the precedence constraints. The problem was formalized as an integer linear programming model. To solve it an exact approach and the heuristic approach ILS were used. Computational experiments are conducted on different industrial cases to evaluate and to compare the performances of the proposed approaches. The results confirm the effectiveness of the ILS approach.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Manceaux Antoine, Bril El-Haouzi Hind, Ramdane Cherif-Khettaf Wahiba, Bentaha Mohand Lounes,