246
Views
3
CrossRef citations to date
0
Altmetric
Research Articles

Investigating two variants of the sequence-dependent robotic assembly line balancing problem by means of a split-based approach

, , , &
Pages 2322-2338 | Received 31 May 2021, Accepted 29 Mar 2022, Published online: 19 Apr 2022

References

  • Abdous, Mohammed Amine. 2019. “Optimal Design of Manufacturing Systems With Ergonomics: Application to Assembly Lines.” PhD diss., Lyon.
  • Allahverdi, Ali, C. T. Ng, T. C. Edwin Cheng, and Mikhail Y. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times Or Costs.” European Journal of Operational Research 187 (3): 985–1032.
  • Andres, Carlos, Cristobal Miralles, and Rafael Pastor. 2008. “Balancing and Scheduling Tasks in Assembly Lines with Sequence-dependent Setup Times.” European Journal of Operational Research 187 (3): 1212–1223.
  • Battaïa, Olga, and Alexandre Dolgui. 2013. “A Taxonomy of Line Balancing Problems and Their Solution Approaches.” International Journal of Production Economics 142 (2): 259–277.
  • Beasley, John E. 1983. “Route First–Cluster Second Methods for Vehicle Routing.” Omega 11 (4): 403–408.
  • Borba, Leonardo, and Marcus Ritt. 2014. “A Heuristic and a Branch-and-Bound Algorithm for the Assembly Line Worker Assignment and Balancing Problem.” Computers & Operations Research 45 (1): 87–96.
  • Borba, Leonardo, Marcus Ritt, and Cristóbal Miralles. 2018. “Exact and Heuristic Methods for Solving the Robotic Assembly Line Balancing Problem.” European Journal of Operational Research 270 (1): 146–156.
  • Brodny, Jarosław, and Magdalena Tutak. 2021. “Assessing the Level of Digitalization and Robotization in the Enterprises of the European Union Member States.” PloS one 16 (7): e0254993.
  • Chechik, Shiri, Haim Kaplan, Mikkel Thorup, Or Zamir, and Uri Zwick. 2016. “Bottleneck Paths and Trees and Deterministic Graphical Games.” In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
  • Çil, Zeynel Abidin, Süleyman Mete, and Kürşad Ağpak. 2016. “A Goal Programming Approach for Robotic Assembly Line Balancing Problem.” IFAC-PapersOnLine 49 (12): 938–942.
  • Dong, Xingye, Houkuan Huang, and Ping Chen. 2009. “An Iterated Local Search Algorithm for the Permutation Flowshop Problem with Total Flowtime Criterion.” Computers & Operations Research 36 (5): 1664–1669.
  • Gao, Jie, Linyan Sun, Lihua Wang, and Mitsuo Gen. 2009. “An Efficient Approach for Type II Robotic Assembly Line Balancing Problems.” Computers & Industrial Engineering 56 (3): 1065–1080.
  • Hana Gažová, Adamková. 2020. “Industry 4.0 Brings Changes in Human Resources.” In SHS Web of Conferences, Vol. 83, 01016. EDP Sciences.
  • Janardhanan, Mukund Nilakantan, Zixiang Li, Grzegorz Bocewicz, Zbigniew Banaszak, and Peter Nielsen. 2019. “Metaheuristic Algorithms for Balancing Robotic Assembly Lines with Sequence-Dependent Robot Setup Times.” Applied Mathematical Modelling 65: 256–270.
  • Lahrichi, Youssef, Laurent Deroussi, Nathalie Grangeon, and Sylvie Norre. 2020. “A Min-Max Path Approach for Balancing Robotic Assembly Lines With Sequence-Dependent Setup Times.” In International Conference on Modeling, Optimization and Simulation (MOSIM), 10.
  • Lahrichi, Youssef, Nathalie Grangeon, Laurent Deroussi, and Sylvie Norre. 2021. “A New Split-Based Hybrid Metaheuristic for the Reconfigurable Transfer Line Balancing Problem.” International Journal of Production Research 59 (4): 1127–1144.
  • Levitin, Gregory, Jacob Rubinovitz, and Boris Shnits. 2006. “A Genetic Algorithm for Robotic Assembly Line Balancing.” European Journal of Operational Research 168 (3): 811–825.
  • Miralles, Cristóbal, José P García-Sabater, Carlos Andrés, and Manuel Cardós. 2008. “Branch and Bound Procedures for Solving the Assembly Line Worker Assignment and Balancing Problem: Application to Sheltered Work Centres for Disabled.” Discrete Applied Mathematics 156 (3): 352–367.
  • Nilakantan, J. M.ukund, Sivalinga Govinda Ponnambalam, N. Jawahar, and Ganesan Kanagaraj. 2015. “Bio-Inspired Search Algorithms to Solve Robotic Assembly Line Balancing Problems.” Neural Computing and Applications 26 (6): 1379–1393.
  • Prins, Christian. 2004. “A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem.” Computers & Operations Research 31 (12): 1985–2002.
  • Prins, Christian, Philippe Lacomme, and Caroline Prodhon. 2014. “Order-First Split-Second Methods for Vehicle Routing Problems: A Review.” Transportation Research Part C: Emerging Technologies 40 (1): 179–200.
  • Rubinovitz, Jacob, Joseph Bukchin, and Ehud Lenz. 1993. “RALB–A Heuristic Algorithm for Design and Balancing of Robotic Assembly Lines.” CIRP Annals 42 (1): 497–500.
  • Salveson, Melvin E. 1955. “The Assembly Line Balancing Problem.” The Journal of Industrial Engineering 6: 18–25.
  • Scholl, Armin, Nils Boysen, and Malte Fliedner. 2013. “The Assembly Line Balancing and Scheduling Problem with Sequence-Dependent Setup Times: Problem Extension, Model Formulation and Efficient Heuristics.” OR Spectrum 35 (1): 291–320.
  • Sewell, Edward C., and Sheldon H. Jacobson. 2012. “A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem.” INFORMS Journal on Computing 24 (3): 433–442.
  • Yoosefelahi, A., M. Aminnayeri, H. Mosadegh, and H. Davari Ardakani. 2012. “Type II Robotic Assembly Line Balancing Problem: An Evolution Strategies Algorithm for a Multi-Objective Model.” Journal of Manufacturing Systems 31 (2): 139–151.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.