An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
سال انتشار: 1387
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 438
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-2-3_004
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other existing algorithms. The ffectiveness of IGA is demonstrated through comparison
کلیدواژه ها:
نویسندگان
Bahman Naderi
Department of Indusrial Engineering, Amirkabir University of Technology, Tehran, Iran
Mostafa Zandieh
Department of Industrial Management, Shahid Beheshti University,G.C., Tehran, Iran
Seyed Mohammad Taghi Fatemi Ghomi
Department of Indusrial Engineering, Amirkabir University of Technology, Tehran, Iran