کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
568155 | 876271 | 2009 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزار
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper, we consider minimizing total weighted completion time criteria on a single machine. Jobs processing times are step function of its starting time and all jobs have a common due date. First, we present some new lemmas and dominance properties for this NP-hard problem, and then a memetic algorithm using these properties is developed. We compare the solutions of the memetic algorithm with optimal solutions obtained from complete enumeration. The results show that the average percentage error of the proposed algorithm from optimal solutions is about 2% and as the variance of processing time increase, the percentage errors decrease.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Advances in Engineering Software - Volume 40, Issue 10, October 2009, Pages 1074–1077
Journal: Advances in Engineering Software - Volume 40, Issue 10, October 2009, Pages 1074–1077
نویسندگان
Jalil Layegh, Fariborz Jolai, Mohsen Sadegh Amalnik,