کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1704437 | 1012408 | 2012 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Several single-machine scheduling problems with general learning effects
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Several single-machine scheduling problems with general learning effects Several single-machine scheduling problems with general learning effects](/preview/png/1704437.png)
چکیده انگلیسی
In this paper we consider several single-machine scheduling problems with general learning effects. By general learning effects, we mean that the processing time of a job depends not only on its scheduled position, but also on the total normal processing time of the jobs already processed. We show that the scheduling problems of minimization of the makespan, the total completion time and the sum of the θ th (θ⩾0θ⩾0) power of job completion times can be solved in polynomial time under the proposed models. We also prove that some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem can be solved in polynomial time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 36, Issue 11, November 2012, Pages 5650–5656
Journal: Applied Mathematical Modelling - Volume 36, Issue 11, November 2012, Pages 5650–5656
نویسندگان
Yuan-Yuan Lu, Cai-Min Wei, Ji-Bo Wang,