کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
392759 | 665156 | 2014 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Single machine scheduling with sum-of-logarithm-processing-times based deterioration
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this study we consider the single machine scheduling problems with sum-of-logarithm-processing-times based deterioration, i.e., the actual job processing time is a function of the sum of the logarithm of the processing times of the jobs already processed. We show that even with the introduction of the sum-of-logarithm-processing-times based deterioration to job processing times, single machine makespan minimization problem remain polynomially solvable. But for the total completion time minimization problem, we show that the optimal schedule is not always V-shaped with respect to job normal processing times. Heuristic algorithms and computational results are presented for the total completion time minimization problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 274, 1 August 2014, Pages 303–309
Journal: Information Sciences - Volume 274, 1 August 2014, Pages 303–309
نویسندگان
Na Yin, Liying Kang, Ping Ji, Ji-Bo Wang,