کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6895410 | 1445974 | 2016 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance](/preview/png/6895410.png)
چکیده انگلیسی
We study due-date assignment problems with common flow allowance on a proportionate flowshop. We focus on both minsum and minmax objectives. Both cases are extended to a setting of a due-window. The proposed solution procedures are shown to be significantly different from those of the single machine problems. All the problems studied here are solved in polynomial time: the minsum problems in O(n2) and the minmax problems in O(nlogân), where n is the number of jobs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 254, Issue 2, 16 October 2016, Pages 360-370
Journal: European Journal of Operational Research - Volume 254, Issue 2, 16 October 2016, Pages 360-370
نویسندگان
Baruch Mor, Gur Mosheiov,