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

Creative Commons License

Eliiyi D. T., Oezlen M.

COMPUTERS & OPERATIONS RESEARCH, vol.35, no.3, pp.933-943, 2008 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 35 Issue: 3
  • Publication Date: 2008
  • Doi Number: 10.1016/j.cor.2006.05.011
  • Journal Name: COMPUTERS & OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.933-943
  • Keywords: mixed-model flow lines, makespan, lagrangean relaxation, TIME PRODUCTION SYSTEMS, ASSEMBLY LINES, LEVEL SCHEDULES, ALGORITHMS, WORK, DESIGN, JOBS
  • Dokuz Eylül University Affiliated: No

Abstract

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.