کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1148144 | 957821 | 2010 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Machine covering with combined partial information
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Machine covering with combined partial information Machine covering with combined partial information](/preview/png/1148144.png)
چکیده انگلیسی
Machine scheduling and covering problems may occur in many applications such as load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc. In this paper we study machine covering problems with combined partial information on m parallel identical machines. We consider sequences where the processing time of all jobs are at most 1/k1/k times of the optimal value (for an integer k). For the case where the optimal value is not known in advance, we show that LS algorithm is optimal. For the case where the optimal value is known in advance, we give lower bounds and present semi-online algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Statistical Planning and Inference - Volume 140, Issue 8, August 2010, Pages 2351–2354
Journal: Journal of Statistical Planning and Inference - Volume 140, Issue 8, August 2010, Pages 2351–2354
نویسندگان
Yong Wu, Qifan Yang, Yikun Huang,