کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483359 | 1446231 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The utilization of U-shaped layouts in place of the traditional straight-line configuration has become increasingly popular, with reported benefits of substantial improvements in productivity and quality. This paper examines the U-line balancing problem with stochastic task times. A chance-constrained, piecewise-linear, integer program is formulated to find the optimal solution. Various approaches used to identify a tight lower bound are also presented, as are operable extensions to the basic model. Computational results show that the proposed method is able to solve practical-sized problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 168, Issue 3, 1 February 2006, Pages 771–782
Journal: European Journal of Operational Research - Volume 168, Issue 3, 1 February 2006, Pages 771–782
نویسندگان
Timothy L. Urban, Wen-Chyuan Chiang,