Model and metaheuristics for robotic two-sided assembly line balancing problems with setup times
Two-sided robotic assembly lines are employed to assemble large-sized high-volume products, where robots are allocated to the workstations to perform the tasks and human workers are replaced for achieving lower cost and greater flexibility in production. In the two-sided robotic assembly lines, setu...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier B.V.
2019
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/26103/1/Model%20and%20metaheuristics%20for%20robotic%20two-sided%20assembly%20.pdf http://umpir.ump.edu.my/id/eprint/26103/ https://doi.org/10.1016/j.swevo.2019.100567 https://doi.org/10.1016/j.swevo.2019.100567 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Two-sided robotic assembly lines are employed to assemble large-sized high-volume products, where robots are allocated to the workstations to perform the tasks and human workers are replaced for achieving lower cost and greater flexibility in production. In the two-sided robotic assembly lines, setup times are unavoidable and it has been ignored in most of the reported works. There has been limited attention on this till date. This paper focusses on the robotic two-sided assembly line with consideration of sequence-dependent setup times and robot setup times. A new mixed integer linear programming model is developed with the objective of optimizing the cycle time. Due to the NP-hard nature of the considered problem, this paper proposes a set of metaheuristics to solve this considered problem, where two main scenarios with low and high setup time’s variability are considered. Computational results verify that this new model is capable to achieve the optimal solutions for small-size instances whereas the simple adoption of the published mathematical model might produce wrong solutions for the considered problem. A comprehensive study with 13 algorithms demonstrates that the two variants of artificial bee colony algorithm and migrating bird optimization algorithm are capable to achieve the optimality for small-size instances and to obtain promising results for large-size instances. |
|---|