کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479110 | 1446193 | 2007 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Single machine scheduling problem with controllable processing times and resource dependent release times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Single machine scheduling problem with controllable processing times and resource dependent release times Single machine scheduling problem with controllable processing times and resource dependent release times](/preview/png/479110.png)
چکیده انگلیسی
We consider two single machine scheduling problems with resource dependent release times and processing times, in which the release times and processing times are linearly decreasing functions of the amount of resources consumed. The objective is to minimize the total cost of makespan and resource consumption function that is composed of release time reduction and processing time reduction. In the first problem, the cost of reducing a unit release time for each job is common. We show that the problem can be solved in polynomial time. The second problem assumes different reduction costs of job release times. We show that the problem can be reduced polynomially from the partition problem and thus, is NP-complete.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 181, Issue 2, 1 September 2007, Pages 645–653
Journal: European Journal of Operational Research - Volume 181, Issue 2, 1 September 2007, Pages 645–653
نویسندگان
Byung-Cheon Choi, Suk-Hun Yoon, Sung-Jin Chung,