کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
436595 | 690017 | 2014 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Semi-online scheduling with two GoS levels and unit processing time
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Semi-online scheduling with two GoS levels and unit processing time Semi-online scheduling with two GoS levels and unit processing time](/preview/png/436595.png)
چکیده انگلیسی
In this paper, we consider two semi-online scheduling problems of parallel machines with two GoS (grade of service) levels and unit processing time, in which the objective is to minimize the makespan. Assume that the GoS levels of the first s machines are 2 and that of the last (m−s)(m−s) machines are 1 where m is the number of machines. The first problem is the lookahead version where an online algorithm is able to foresee the information of the next k jobs. The second problem is the buffer version where a buffer is available for storing at most g jobs. For the both versions, we prove that the lookahead ability or the buffer is useless for designing algorithm when k
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 521, 13 February 2014, Pages 62–72
Journal: Theoretical Computer Science - Volume 521, 13 February 2014, Pages 62–72
نویسندگان
Taibo Luo, Yinfeng Xu, Li Luo, Changzheng He,