کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634296 | 1340690 | 2007 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs](/preview/png/4634296.png)
چکیده انگلیسی
Today’s importance of on time deliveries according to JIT concept makes managers to consider a desired set of extra ‘due date related’ criteria in the workshop scheduling. These criteria can be stated as tardiness, number of tardy jobs, and earliness. In this paper we focus on the bi-criteria scheduling problem of minimizing the number of tardy jobs and maximum earliness for single machine, in which the idle time is not allowed. The problem is known to be NP-hard. For this problem we developed a genetic algorithm by exploiting its general structure that further improves the initial population, utilizing a heuristic algorithm on the initial population. We present a computational experiment that shows the performance of the developed GA.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 194, Issue 2, 15 December 2007, Pages 552–560
Journal: Applied Mathematics and Computation - Volume 194, Issue 2, 15 December 2007, Pages 552–560
نویسندگان
Fariborz Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan, M. Yazadn Parast,