کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
435721 | 689930 | 2015 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Semi-online hierarchical load balancing problem with bounded processing times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Semi-online hierarchical load balancing problem with bounded processing times Semi-online hierarchical load balancing problem with bounded processing times](/preview/png/435721.png)
چکیده انگلیسی
In this paper, we consider the online hierarchical scheduling problem on two parallel machines, with the objective of maximizing the minimum machine load. Since no competitive algorithm exists for this problem, we consider the semi-online version with bounded processing times, in which the processing times are bounded by an interval [1,α][1,α] where α≥1α≥1. We prove that no algorithm can have a competitive ratio less than 1+α1+α and present an optimal algorithm. Moreover, if we further know the sum of jobs' processing times in advance, we prove that no algorithm can have a competitive ratio less than α where 1≤α<21≤α<2, and propose an α-competitive algorithm for this case.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 607, Part 1, 23 November 2015, Pages 75–82
Journal: Theoretical Computer Science - Volume 607, Part 1, 23 November 2015, Pages 75–82
نویسندگان
Taibo Luo, Yinfeng Xu,