A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements

Ogan D., AZİZOĞLU M.

JOURNAL OF MANUFACTURING SYSTEMS, cilt.36, ss.46-54, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1016/j.jmsy.2015.02.007
  • Dergi Adı: JOURNAL OF MANUFACTURING SYSTEMS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.46-54
  • Anahtar Kelimeler: U-shaped assembly line, Equipment requirement, Branch and bound algorithm, REMEMBER ALGORITHM
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bounds. We find that the algorithm is able to solve moderate sized problem instances in reasonable times. (C) 2015 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.