کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347198 | 699096 | 2012 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations](/preview/png/10347198.png)
چکیده انگلیسی
⺠We considered assembly line balancing problems with parallel multi-manned workstations which can be used for modeling lines producing big-sized complex products. ⺠A branch and bound based exact solution algorithm including some efficient components which are developed based on problem-specific knowledge is proposed. ⺠Through an analysis of comparison results, it has been seen that the proposed algorithm has better performance than the other one in terms of CPU times of optimal solutions, and quality of feasible solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3344-3360
Journal: Computers & Operations Research - Volume 39, Issue 12, December 2012, Pages 3344-3360
نویسندگان
Talip Kellegöz, Bilal Toklu,