کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
421229 | 684163 | 2012 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times An improved on-line algorithm for single parallel-batch machine scheduling with delivery times](/preview/png/421229.png)
چکیده انگلیسی
We study an on-line single parallel-batch machine scheduling problem where each job has a processing time and a delivery time. Jobs arrive over time and the batch capacity is unbounded. Jobs can be processed in a common batch, and each job is delivered independently and immediately at its completion time on the machine. The objective is to minimize the time by which all the jobs are delivered. We provide an on-line algorithm with a competitive ratio 22−1≈1.828, which improves on a 2-competitive on-line algorithm for this problem in the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 160, Issues 7–8, May 2012, Pages 1191–1210
Journal: Discrete Applied Mathematics - Volume 160, Issues 7–8, May 2012, Pages 1191–1210
نویسندگان
Ji Tian, T.C.E. Cheng, C.T. Ng, Jinjiang Yuan,