پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,226 |
| تعداد مقالات | 67,694 |
| تعداد مشاهده مقاله | 115,005,160 |
| تعداد دریافت فایل اصل مقاله | 89,685,377 |
Online Scheduling of Jobs for D-benevolent instances On Identical Machines | ||
| Journal of Algorithms and Computation | ||
| مقاله 3، دوره 47، شماره 1، شهریور 2016، صفحه 27-36 اصل مقاله (276.57 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2016.7933 | ||
| نویسندگان | ||
| I. Mohammadi* 1؛ Dara Moazzami2 | ||
| 1University of Tehran, Department of Algorithms and Computation. | ||
| 2University of Tehran, College of Engineering, Faculty of Engineering Science | ||
| چکیده | ||
| We consider online scheduling of jobs with speci c release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contribute on pro t of the algorithm. In this paper we study D-benevolent instances which is a wide and standard class and we give a new algorithm, that admits (2m + 4)-competitive ratio. It is almost half of the previous known upper bound for this problem. | ||
| کلیدواژه‌ها | ||
| Online Algorithms Scheduling Identical Machine؛ Upper bound | ||
|
آمار تعداد مشاهده مقاله: 975 تعداد دریافت فایل اصل مقاله: 646 |
||