کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10331371 | 686683 | 2005 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
No-wait scheduling in single-hop multi-channel LANs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: No-wait scheduling in single-hop multi-channel LANs No-wait scheduling in single-hop multi-channel LANs](/preview/png/10331371.png)
چکیده انگلیسی
An extended version of the multiprocessor machine scheduling problem with makespan objective, which arises from single-hop multi-channel LANs, is presented in this paper. In this scheduling model, each job consists of two operations, and each operation may be processed by anyone of a given set of machines, while in the job shop scheduling problem, such a set contains only one machine. For this NP-complete problem, we first analyze the performance ratios of two simple strategies, List Scheduling and Longest Processing Time First, for the off-line cases, which have performance ratios (5/2â1/2m) and (2+1/2(m+1)), respectively, with (m+1) being the number of the machines. We also show that the competitive ratio of the List Scheduling strategy for the on-line cases is (7/2â1/2m).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 93, Issue 1, 16 January 2005, Pages 19-24
Journal: Information Processing Letters - Volume 93, Issue 1, 16 January 2005, Pages 19-24
نویسندگان
Fengfeng Zhou, Yinlong Xu, Guoliang Chen,