کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10333911 | 689839 | 2011 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal algorithms for online scheduling with bounded rearrangement at the end
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal algorithms for online scheduling with bounded rearrangement at the end Optimal algorithms for online scheduling with bounded rearrangement at the end](/preview/png/10333911.png)
چکیده انگلیسی
Especially, for the lower bound, (i) for sâ¥2 an improved lower bound s+2s+1 is obtained, which is better than (s+1)2s2+s+1 (Liu et al. (2009) [9]); (ii) for 1+52â¤s<2, an improved lower bound s2s2âs+1 is obtained, which is better than (s+1)2s2+s+1 (Liu et al. (2009) [9]). For the upper bound, (i) for sâ¥2 and K=1, a new upper bound s+2s+1 is obtained, which is optimal and better than the one s+1s in Liu et al. (2009) [9]; (ii) for 1+52â¤s<2 and K=2, an upper bound s2s2âs+1 is proposed, which is optimal and better than the previous one s+1s in Liu et al. (2009) [9]; (iii) for s<1+52 and K=2, an upper bound (s+1)2s2+s+1 is obtained, which is also optimal and better than the previous one min{s+1s,(s+1)2s+2} in Liu et al. (2009) [9].
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 412, Issue 45, 21 October 2011, Pages 6269-6278
Journal: Theoretical Computer Science - Volume 412, Issue 45, 21 October 2011, Pages 6269-6278
نویسندگان
Xin Chen, Yan Lan, Attila Benko, György Dósa, Xin Han,