Robotic stochastic assembly line balancing


Şahin M. C., TURAL M. K.

Flexible Services and Manufacturing Journal, cilt.35, sa.4, ss.1076-1115, 2023 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 4
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1007/s10696-023-09494-x
  • Dergi Adı: Flexible Services and Manufacturing Journal
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.1076-1115
  • Anahtar Kelimeler: Assembly lines, Robotic assembly line balancing, Stochastic assembly line balancing, Industry 4, 0, Human-robot collaboration, EVOLUTIONARY ALGORITHM, GENETIC ALGORITHM, OPTIMIZATION
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

To keep up with the Industry 4.0 technological revolution and get the upper hand over competitors, manufacturing companies replace human workers with robots in their assembly processes. A popular approach in the manufacturing industry is to design an assembly line with human-robot collaboration. In this study, we investigate a robotic stochastic assembly line balancing problem (RSALBP), with the motivation to observe the effects of robots on the cycle time in stochastic assembly lines where human workers and robots operate in different workstations. In the literature, robotic assembly line balancing is only studied with deterministic task times. However, assembly line balancing contains stochastic processes in real life. We assume that the processing time of each task follows a normal distribution whose parameters depend on the type of the operator performing the task with robots having much less (possibly zero) variation in task times than human workers. It is assumed that human workers are fully capable while robots are able to perform a subset of the tasks. We study type-II RSALBP which aims to minimize the cycle time for an assembly line with stochastic task times, given a fixed number of workstations and robots. This problem is NP-hard and includes non-linearity. We propose a mixed-integer second-order cone programming formulation and a constraint programming formulation to solve the problem. Instances from the literature are used to test the effectiveness of the proposed formulations. Additionally, the effects of robots on cycle times are evaluated by conducting a computational study with a comprehensive experimental design.