کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347617 | 699252 | 2012 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints](/preview/png/10347617.png)
چکیده انگلیسی
We study a real-world complex hybrid flow-shop scheduling problem arising from a bio-process industry. There are a variety of constraints to be taken into account, in particular zero intermediate capacity and limited waiting time between processing stages. We propose an exact solution approach for this optimization problem, based on a discrete time representation and a mixed-integer linear programming formulation. The proposed solution algorithm makes use of a new family of valid inequalities exploiting the fact that a limited waiting time is imposed on jobs between two successive production stages. The results of our computational experiments confirm that the proposed method produces good feasible schedules for industrial instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 629-636
Journal: Computers & Operations Research - Volume 39, Issue 3, March 2012, Pages 629-636
نویسندگان
C. Gicquel, L. Hege, M. Minoux, W. van Canneyt,