کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
866034 | 909692 | 2006 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel Machine Scheduling with Special Jobs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS (first come, first served), SWSC (special window for special customers), and FFFS (first fit, first served) algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 and FFFS has a competitive ratio of 3-2/m, and these bounds are tight.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Tsinghua Science & Technology - Volume 11, Issue 1, February 2006, Pages 107-110
Journal: Tsinghua Science & Technology - Volume 11, Issue 1, February 2006, Pages 107-110
نویسندگان
Wang (æ±æ¯æ³¢), Xing (é¢æè®),