Rebalancing the assembly lines with total squared workload and total replacement distance objectives

Girit U., AZİZOĞLU M.

International Journal of Production Research, cilt.59, sa.22, ss.6702-6720, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 59 Sayı: 22
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1080/00207543.2020.1823027
  • Dergi Adı: International Journal of Production Research
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.6702-6720
  • Anahtar Kelimeler: Assembly lines, rebalancing, workload balancing, exact algorithm, tabu search, HEURISTIC ALGORITHM, BALANCING PROBLEM, MODEL
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

Assembly line balancing is an important and well recognised operations research problem. The current line balance may not stay optimal, even feasible, due to the disruptions in one or more workstations. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (fairness measure) and total replacement distance for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective function vectors for the defined fairness and stability measures. Two algorithms are developed: exact algorithm (classical approach) and tabu search algorithm. The results of the experiments have shown that the classical approach returns exact non-dominated objective vectors with up to 40 tasks and 7 workstations in one hour, and the tabu search algorithm returns approximate non-dominated objective vectors that are very close to their exact counterparts and can solve large sized instances with up to 94 tasks and 7 workstations in less than 10 s.