Rebalancing the assembly lines: exact solution approaches

Sanci E., AZİZOĞLU M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.55, sa.20, ss.5991-6010, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 55 Sayı: 20
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1080/00207543.2017.1319583
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.5991-6010
  • Anahtar Kelimeler: assembly lines, rebalancing, mixed integer linear programming, branch and bound algorithm, nondominated objective vectors, RE-BALANCING PROBLEM, HEURISTIC ALGORITHM, OPTIMIZATION, MODEL, SYSTEMS, DESIGN
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned to different workstations in the original and new balances. Our aim is to generate all nondominated objective vectors with respect to the efficiency and stability measures. We develop two optimisation algorithms: a Mixed Integer Linear Programming-based algorithm and a Branch and Bound algorithm. The results of our experiments have shown the favourable performances of both algorithms and the superiority of the Branch and Bound algorithm.