کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5080973 | 1477582 | 2012 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel machine scheduling problems with common flow-allowance
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Parallel machine scheduling problems with common flow-allowance Parallel machine scheduling problems with common flow-allowance](/preview/png/5080973.png)
چکیده انگلیسی
In due-date assignment problems with a common flow-allowance, the job-dependent due-dates are determined as linear functions of the job processing times. This paper studies due-date and due-window assignment problems based on flow-allowance with a minmax objective function. We consider a setting of parallel identical machines. The problems are proved to be NP-hard, and efficient heuristic procedures and simple lower bounds are introduced. Worst case analysis is provided in both cases. Our numerical tests indicate that the heuristics produce extremely close-to-optimal schedules. Our procedures (heuristics and bounds) are extended to parallel uniform machines, and based on our numerical tests, the average optimality gaps remain very small.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 139, Issue 2, October 2012, Pages 623-633
Journal: International Journal of Production Economics - Volume 139, Issue 2, October 2012, Pages 623-633
نویسندگان
Baruch Mor, Gur Mosheiov,