Scheduling of a Hybrid Flow Shop with Multiprocessor Tasks by a Hybrid Approach Based on Genetic and Imperialist Competitive Algorithms
سال انتشار: 1392
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 379
فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-6-13_001
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA and ICA are proposed to solve the generated problems. The performances of algorithms are evaluated by computational time and Relative Percentage Deviation (RPD) factors. The results indicate that ICA solves the problems faster than other algorithms and the hybrid algorithm produced best solution based on RPD
کلیدواژه ها:
نویسندگان
Javad Rezaeian
Assistant Professor, Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran
Hany Seidgar
MSc, Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran
Morteza Kiani
MSc, Department of industrial engineering, Mazandaran University of Science and Technology, Babol, Iran