A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem

DEMİRKOL AKYOL Ş., BAYKASOĞLU A.

JOURNAL OF INTELLIGENT MANUFACTURING, cilt.30, sa.2, ss.557-573, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 30 Sayı: 2
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1007/s10845-016-1262-6
  • Dergi Adı: JOURNAL OF INTELLIGENT MANUFACTURING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.557-573
  • Anahtar Kelimeler: Assembly line balancing, Worker assignment, Heuristic approaches, Variable task times, Combinatorial optimization, OPTIMIZATION MODEL, BOUND ALGORITHM, HEURISTICS, CENTERS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper proposes a constructive heuristic approach for the assembly line worker assignment and balancing problem (ALWABP). ALWABP arises when the operation time for every task differs according to the worker who executes the task. Since the operation times of tasks vary due to the workers, the problem requires a simultaneous solution to the double assignment problem. Tasks must be assigned to workers and workers to stations, concurrently. This problem is especially proposed in sheltered work centers for the disabled. However, it is not only important for the assembly lines with the disabled, but also for manually operated assembly lines with high labor turnover. In this paper, a multiple-rule based constructive randomized search (MRBCRS) algorithm is proposed in order to solve the ALWABP. Thirty nine task priority rules and four worker priority rules are defined. Performance of the proposed MRBCRS is compared with the relevant literature on benchmark data. Experimental results show that the proposed MRBCRS is very effective for benchmark problems. The results show that the algorithm improves upon the best-performing methods from the literature in terms of solution quality and time.