کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
419550 | 683835 | 2010 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NPNP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 158, Issue 10, 28 May 2010, Pages 1090–1103
Journal: Discrete Applied Mathematics - Volume 158, Issue 10, 28 May 2010, Pages 1090–1103
نویسندگان
Dvir Shabtay, George Steiner, Liron Yedidsion,