کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481018 | 1446156 | 2009 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A scheduling problem with job values given as a power function of their completion times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper deals with a problem of scheduling jobs on the identical parallel machines, where job values are given as a power function of the job completion times. Minimization of the total loss of job values is considered as a criterion. We establish the computational complexity of the problem – strong NP-hardness of its general version and NP-hardness of its single machine case. Moreover, we solve some special cases of the problem in polynomial time. Finally, we construct and experimentally test branch and bound algorithm (along with some elimination properties improving its efficiency) and several heuristic algorithms for the general case of the problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 193, Issue 3, 16 March 2009, Pages 836–848
Journal: European Journal of Operational Research - Volume 193, Issue 3, 16 March 2009, Pages 836–848
نویسندگان
Adam Janiak, Tomasz Krysiak, Costas P. Pappis, Theodore G. Voutsinas,