کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5081169 | 1477600 | 2011 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal algorithms for single-machine scheduling with rejection to minimize the makespan
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal algorithms for single-machine scheduling with rejection to minimize the makespan Optimal algorithms for single-machine scheduling with rejection to minimize the makespan](/preview/png/5081169.png)
چکیده انگلیسی
In this paper we consider the single-machine scheduling problem with rejection. Each job has an arrival time, a processing time and a rejection penalty. The objective is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. First, we present a polynomial-time algorithm for the off-line problem when split is allowed. Second, for the on-line problem with arbitrary arrival times, we provide a determined on-line algorithm with the best-possible competitive ratio 2. Finally, for the on-line problem with at most two distinct arrival times, we provide a determined on-line algorithm with the best-possible competitive ratio (5+1)/2â1.618.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 130, Issue 2, April 2011, Pages 153-158
Journal: International Journal of Production Economics - Volume 130, Issue 2, April 2011, Pages 153-158
نویسندگان
Lingfa Lu, C.T. Ng, Liqi Zhang,