Hybrid ant colony optimization technique for the sequence dependent flowshop scheduling problem
محل انتشار: ششمین کنفرانس بین المللی مهندسی صنایع
سال انتشار: 1387
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 2,119
فایل این مقاله در 14 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC06_072
تاریخ نمایه سازی: 8 مهر 1387
چکیده مقاله:
In many real-world production systems, optimal job scheduling requires an explicit cosideration of sequence- dependent setup times. One of the most important scheduling criteria in practical systems is makespan. Many heuristics and meta-heuristics have been successfully applied to this kind of problem before and the objective of this paper is to propose one meta-heuristic to overcome previous methods is solving this problem. in this paper, we present a hybrid ant colony optimization (HACO) algorithm for the sequence dependent permutation flowshop scheduling problem. the proposed HACO algorithm benefits of a new approach for computing the initial pheromone values and some local search structures. the proposed algorithm is experimented on the randomly problem istances and results indicate that it is very competitive the with the axisting best metaheuristics.
کلیدواژه ها:
نویسندگان
M. Mirabi
Department of Industrial Engineering, Amirkabir University of Technology
S. M. T. Fatemi Ghomi
Department of Industrial Engineering, Amirkabir University of Technology
F. Jolai
Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran