کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475925 | 699396 | 2009 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On-line scheduling of two parallel machines with a single server
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On-line scheduling of two parallel machines with a single server On-line scheduling of two parallel machines with a single server](/preview/png/475925.png)
چکیده انگلیسی
In this paper, we consider the on-line scheduling of two parallel identical machines sharing a single server with the objective of minimizing the latest completion time of all jobs. Each job has to be setup by the server before being processed on one of the machines. Three special cases: equal length jobs, equal processing times and regular equal setup times are considered and the asymptotic competitive ratios of list scheduling are determined. Also, a lower bound for the equal length job case is given, and two heuristics with tight asymptotic competitive ratios for the other two cases are proposed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 5, May 2009, Pages 1529–1553
Journal: Computers & Operations Research - Volume 36, Issue 5, May 2009, Pages 1529–1553
نویسندگان
Lele Zhang, Andrew Wirth,