|
|
International Journal of Engineering، جلد ۲۳، شماره ۳، صفحات ۲۲۷-۲۳۴
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS |
|
| چکیده انگلیسی مقاله |
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in preventing from being trapped in a local optimum, two methods were used to overcome this problem. Because of the novelty of the considered problem, there was no standard benchmark available to test the developed algorithms, so the results were checked by a lower bound which was calculated by a procedure that emphasizes on job deterioration effects. The tests and evaluations illustrate the effectiveness of the presented algorithms. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
Abdolmajid Yolmeh |
Industrial Engineering, Sharif University
|
|
| نشانی اینترنتی |
http://www.ije.ir/article_71863_722b2d35a63e36bcda4a13526b9d5525.pdf |
| فایل مقاله |
فایلی برای مقاله ذخیره نشده است |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|