کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134956 | 1489100 | 2011 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Two due date assignment problems with position-dependent processing time on a single-machine
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Two due date assignment problems with position-dependent processing time on a single-machine Two due date assignment problems with position-dependent processing time on a single-machine](/preview/png/1134956.png)
چکیده انگلیسی
The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing the due dates, the total cost of positional weight earliness, and the total cost of the discarded jobs that cannot be completed by their due dates. We conclude that the problems are polynomial time solvable. Significantly enough, after assessing the special case of each problem, this research found out that they can be optimally solved by lower order algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 60, Issue 4, May 2011, Pages 796–800
Journal: Computers & Industrial Engineering - Volume 60, Issue 4, May 2011, Pages 796–800
نویسندگان
Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang,