کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4960187 | 1445959 | 2017 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Combinatorial Benders cuts for assembly line balancing problems with setups
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The classical assembly line balancing problem consists of assigning assembly work to workstations. In the presence of setup times that depend on the sequence of tasks assigned to each workstation, the problem becomes more complicated given that two interdependent problems, namely assignment and sequencing, must be solved simultaneously. The hierarchical nature of these two problems also suggest a natural decomposition of the problem. This paper adopts such an approach and describes an exact algorithm based on Benders decomposition to solve both simple and mixed-model assembly line balancing problems with setups. The algorithm is tested on a set of benchmark instances and numerically compared against a mixed-integer linear programming formulation of the problem solved using a commercial optimizer.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 259, Issue 2, 1 June 2017, Pages 527-537
Journal: European Journal of Operational Research - Volume 259, Issue 2, 1 June 2017, Pages 527-537
نویسندگان
Sener Akpinar, Atabak Elmi, Tolga BektaÅ,