A disassembly line balancing problem with fixed number of workstations

Kalaycilar E. G., AZİZOĞLU M., Yeralan S.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.249, sa.2, ss.592-604, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 249 Sayı: 2
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.ejor.2015.09.004
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.592-604
  • Anahtar Kelimeler: Integer programming, Heuristics, Disassembly lines, Linear programming relaxation
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical, however different parts can be released from different units of the product. There is a finite number of identical workstations that perform the necessary disassembly operations, referred to as tasks. We present several upper and lower bounding procedures that assign the tasks to the workstations so as to maximize the total net revenue. The computational study has revealed that the procedures produce satisfactory results. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.