کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5081327 | 1477594 | 2011 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling with processing set restrictions: PTAS results for several variants
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We consider multiprocessor scheduling to minimize makespan. Each job has a given processing time and in addition, a subset of machines associated with it, also called its processing set. Each job has to be assigned to one machine in its set, thus contributing to the load of this machine. We study two variants of this problem on identical machines, the case of nested processing sets, and the case of tree-hierarchical processing sets. In addition, we consider uniformly related machines with a special case of inclusive processing sets, which has a clear motivation. We design polynomial time approximation schemes for these three variants. The first case resolves one of the open problems stated in the survey by Leung and Li (2008).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 133, Issue 2, October 2011, Pages 586-595
Journal: International Journal of Production Economics - Volume 133, Issue 2, October 2011, Pages 586-595
نویسندگان
Leah Epstein, Asaf Levin,