کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1705268 | 1519420 | 2013 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times](/preview/png/1705268.png)
چکیده انگلیسی
The single-machine scheduling problems with position and sum-of-processing-time based processing times are considered. The actual processing time of a job is defined by function of its scheduled position and total normal processing time of jobs in front of it in the sequence. We provide optimal solutions in polynomial time for some special cases of the makespan minimization and the total completion time minimization. We also show that an optimal schedule to be a V-shaped schedule in terms of the normal processing times of jobs for the total completion time minimization problem and the makespan minimization problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 37, Issues 10–11, 1 June 2013, Pages 6695–6702
Journal: Applied Mathematical Modelling - Volume 37, Issues 10–11, 1 June 2013, Pages 6695–6702
نویسندگان
Yuan-Yuan Lu, Ji-Bo Wang,