Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474161 | Computers & Operations Research | 2008 | 11 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Deniz Türsel Eliiyi, Melih Özlen,