کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475348 | 699291 | 2009 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new model for the preemptive earliness–tardiness scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
This paper addresses a new model for the one-machine earliness–tardiness scheduling problem where jobs can be interrupted. Some dominance rules and a lower bound are derived. A new timing algorithm is also presented and a local search algorithm based on this timing algorithm permits the computation of good feasible solutions. We experimentally compare our timing algorithm with a previously published timing algorithm. The tests show that the execution time of the new timing algorithm is significantly faster, especially for large instances. The values of the solutions are compared to the lower bound.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 7, July 2009, Pages 2242–2249
Journal: Computers & Operations Research - Volume 36, Issue 7, July 2009, Pages 2242–2249
نویسندگان
Nina Runge, Francis Sourd,