کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5081379 | 1477598 | 2011 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine](/preview/png/5081379.png)
چکیده انگلیسی
This paper considers the problem of scheduling deteriorating jobs and due date assignment on a single machine. The actual processing time of a job is a linear increasing function of its starting time. The problem is to determine the optimal due dates and the processing sequence simultaneously to minimize costs for earliness, due date assignment and weighted number of tardy jobs. We present polynomial-time algorithms to solve the problem in the case of two popular due date assignment methods: CON and SLK.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 131, Issue 2, June 2011, Pages 747-751
Journal: International Journal of Production Economics - Volume 131, Issue 2, June 2011, Pages 747-751
نویسندگان
Shisheng Li, C.T. Ng, Jinjiang Yuan,