کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10332231 | 687196 | 2005 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal non-preemptive semi-online scheduling on two related machines
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal non-preemptive semi-online scheduling on two related machines Optimal non-preemptive semi-online scheduling on two related machines](/preview/png/10332231.png)
چکیده انگلیسی
We consider the following non-preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines, with the goal of minimizing the makespan. We analyze both the optimal overall competitive ratio, and the optimal competitive ratio as a function of the speed ratio (q⩾1) between the two machines. We show that the greedy algorithm LPT has optimal competitive ratio 14(1+17)â1.28 overall, but does not have optimal competitive ratio for every value of q. We determine the intervals of q where LPT is an algorithm of optimal competitive ratio, and design different algorithms of optimal competitive ratio for the intervals where it fails to be the best algorithm. As a result, we give a tight analysis of the competitive ratio for every speed ratio.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Algorithms - Volume 57, Issue 1, September 2005, Pages 49-73
Journal: Journal of Algorithms - Volume 57, Issue 1, September 2005, Pages 49-73
نویسندگان
Leah Epstein, Lene M. Favrholdt,