کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482981 | 1446189 | 2007 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On the machine scheduling problem with job delivery coordination
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On the machine scheduling problem with job delivery coordination On the machine scheduling problem with job delivery coordination](/preview/png/482981.png)
چکیده انگلیسی
This paper examines two scheduling problems with job delivery coordination, in which each job demands different amount of storage space during transportation. For the first problem, in which jobs are processed on a single machine and delivered by one vehicle to a customer, we present a best possible approximation algorithm with a worst-case ratio arbitrarily close to 3/2. For the second problem, which differs from the first problem in that jobs are processed by two parallel machines, we give an improved algorithm with a worst-case ratio 5/3.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 182, Issue 3, 1 November 2007, Pages 1057–1072
Journal: European Journal of Operational Research - Volume 182, Issue 3, 1 November 2007, Pages 1057–1072
نویسندگان
Weiya Zhong, György Dósa, Zhiyi Tan,