کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479392 | 1446228 | 2006 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Complexity of flowshop scheduling problems with a new blocking constraint
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This article deals with makespan minimization in the flowshop scheduling problem under the condition of no intermediate storage between machines. A new blocking constraint met in several industrial problems is introduced, and several complexity results are presented from two to five machines. Some problems with four machines in which the new and the classical blocking constraints are mixed, are polynomial. Problems with only the new blocking constraint are polynomial for up to three machines. Although the complexity of the problem with four machines is left open, several cases are shown to be polynomial. Finally the problem with five machines is NP-hard.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 169, Issue 3, 16 March 2006, Pages 855–864
Journal: European Journal of Operational Research - Volume 169, Issue 3, 16 March 2006, Pages 855–864
نویسندگان
S. Martinez, S. Dauzère-Pérès, C. Guéret, Y. Mati, N. Sauer,