Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10136125 | Applied Mathematical Modelling | 2019 | 25 Pages |
Abstract
Industries are incorporating robots into assembly lines due to their greater flexibility and reduced costs. Most of the reported studies did not consider scheduling of tasks or the sequence-dependent setup times in an assembly line, which cannot be neglected in a real-world scenario. This paper presents a study on robotic assembly line balancing, with the aim of minimizing cycle time by considering sequence-dependent setup times. A mathematical model for the problem is formulated and CPLEX solver is utilized to solve small-sized problems. A recently developed metaheuristic Migrating Birds Optimization (MBO) algorithm and set of metaheuristics have been implemented to solve the problem. Three different scenarios are tested (with no setup time, and low and high setup times). The comparative experimental study demonstrates that the performance of the MBO algorithm is superior for the tested datasets. The outcomes of this study can help production managers improve their production system in order to perform the assembly tasks with high levels of efficiency and quality.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Mukund Nilakantan Janardhanan, Zixiang Li, Grzegorz Bocewicz, Zbigniew Banaszak, Peter Nielsen,