|
|
Journal of Industrial and Systems Engineering، جلد ۸، شماره ۲، صفحات ۶۷-۸۵
|
|
|
| عنوان فارسی |
|
|
| چکیده فارسی مقاله |
|
|
| کلیدواژه‌های فارسی مقاله |
|
|
| عنوان انگلیسی |
A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times |
|
| چکیده انگلیسی مقاله |
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combined with genetic operators. Also, an application of simulated annealing is presented for the evaluation of the algorithms. A Taguchi design is conducted to set their parameters. Finally, a comparison is made via 16 small size and 24 large size test problems and each problem is run 10times. The results of one-way ANOVA demonstrate that the proposed memetic algorithm performs as efficient as the HSA qualitatively and with 63.77% decline in elapsed time. |
|
| کلیدواژه‌های انگلیسی مقاله |
|
|
| نویسندگان مقاله |
فرزانه رجایی ابیانه | farzaneh rajaee
department of industrial engineering, k.n.toosiuniversity of technology, tehran, iran
سعیده غلامی |
department of industrial engineering, k.n.toosiuniversity of technology, tehran, iran
|
|
| نشانی اینترنتی |
http://www.jise.ir/article_9797_36ccc21ed206710db1d68deaea1329f7.pdf |
| فایل مقاله |
فایلی برای مقاله ذخیره نشده است |
| کد مقاله (doi) |
|
| زبان مقاله منتشر شده |
en |
| موضوعات مقاله منتشر شده |
|
| نوع مقاله منتشر شده |
|
|
|
|
برگشت به:
صفحه اول پایگاه |
نسخه مرتبط |
نشریه مرتبط |
فهرست نشریات
|