کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477031 | 1446100 | 2011 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel machines scheduling with machine maintenance for minsum criteria
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Parallel machines scheduling with machine maintenance for minsum criteria Parallel machines scheduling with machine maintenance for minsum criteria](/preview/png/477031.png)
چکیده انگلیسی
This paper considers a parallel-machine scheduling problem with machine maintenance. There are unavailable periods on each of the first k machines, and the remaining m − k machines are always available, where 1 ⩽ k ⩽ m is an integer. The objective is to minimize the total completion time of all jobs. We show the classical SPT algorithm has a worst-case ratio of at most 1+m-1m-k when k < m. If there is exactly one unavailable period on each of the first k machines, and the unavailable periods do not overlap, the worst-case ratio of SPT is at most 2+k-1m-1, and no polynomial time approximation algorithm with worst-case ratio less than mm-1 can exist when k = m unless P = NP.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 212, Issue 2, 16 July 2011, Pages 287–292
Journal: European Journal of Operational Research - Volume 212, Issue 2, 16 July 2011, Pages 287–292
نویسندگان
Zhiyi Tan, Yong Chen, An Zhang,