کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482197 | 1446183 | 2008 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dominance-based heuristics for one-machine total cost scheduling problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time. We describe dominance rules for these criteria, as well as techniques for using these dominance rules to build heuristic solutions. We use them to improve certain well-known greedy heuristic algorithms from the literature. Finally, we introduce a Tabu Search method with a neighborhood based on our dominance rules. Experiments show the effectiveness of our techniques in obtaining very good solutions for all studied criteria.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 184, Issue 3, 1 February 2008, Pages 879–899
Journal: European Journal of Operational Research - Volume 184, Issue 3, 1 February 2008, Pages 879–899
نویسندگان
Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste,