A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

Eliiyi D. T., Oezlen M.

COMPUTERS & OPERATIONS RESEARCH, cilt.35, sa.3, ss.933-943, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 3
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1016/j.cor.2006.05.011
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.933-943
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

In this study, a mixed-model flow line sequencing problem is considered. A mixed-model flow line is a special case of production line where products are transported on a conveyor belt, and different models of the same product are intermixed on the same line. We have focused on product-fixed, rate-synchronous lines with variable launching. Our objective function is minimizing makespan. A heuristic algorithm based on Lagrangean relaxation is developed for the problem, and tested in terms of solution quality and computational efficiency. (c) 2006 Elsevier Ltd. All rights reserved.