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

Eliiyia, D and Ozlen, M 2008, 'A Lagrangean relaxation approach for the mixed-model flow line sequencing problem.', Computers and Operations Research, vol. 35, no. 3, pp. 933-943.


Document type: Journal Article
Collection: Journal Articles

Attached Files
Name Description MIMEType Size
n2006012158.pdf Accepted Manuscript application/pdf 129.14KB
Title A Lagrangean relaxation approach for the mixed-model flow line sequencing problem.
Author(s) Eliiyia, D
Ozlen, M
Year 2008
Journal name Computers and Operations Research
Volume number 35
Issue number 3
Start page 933
End page 943
Total pages 10
Publisher Pergamon
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.
Subject Operations Research
Keyword(s) mixed-model flow lines
Makespan
Lagrangean relaxation
DOI - identifier 10.1016/j.cor.2006.05.011
Copyright notice © 2006 Elsevier Ltd. All rights reserved.
ISSN 0305-0548
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 4 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 7 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 239 Abstract Views, 16 File Downloads  -  Detailed Statistics
Created: Mon, 04 Oct 2010, 13:29:39 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us