کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1142605 957157 2010 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Complexity of a scheduling problem with controllable processing times
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Complexity of a scheduling problem with controllable processing times
چکیده انگلیسی

We consider the problem of scheduling a set of independent jobs on a single machine so as to minimize the total weighted completion time, subject to the constraint that the total compression cost is less than or equal to a fixed amount. The complexity of this problem is mentioned as an open problem. In this note we show that the problem is NP-hard.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 38, Issue 2, March 2010, Pages 123–126
نویسندگان
, , ,