کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9663752 | 1446241 | 2005 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The two-machine flow-shop problem with weighted late work criterion and common due date
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The two-machine flow-shop problem with weighted late work criterion and common due date The two-machine flow-shop problem with weighted late work criterion and common due date](/preview/png/9663752.png)
چکیده انگلیسی
The paper is on the two-machine non-preemptive flow-shop scheduling problem with a total weighted late work criterion and a common due date (F2|di=d|Yw). The late work performance measure estimates the quality of the obtained solution with regard to the duration of late parts of tasks not taking into account the quantity of this delay. We prove the binary NP-hardness of the problem mentioned by showing a transformation from the partition problem to its decision counterpart. Then, a dynamic programming approach of pseudo-polynomial time complexity is formulated.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 165, Issue 2, 1 September 2005, Pages 408-415
Journal: European Journal of Operational Research - Volume 165, Issue 2, 1 September 2005, Pages 408-415
نویسندگان
Jacek BÅażewicz, Erwin Pesch, MaÅgorzata Sterna, Frank Werner,