Two Ant Algorithms Based on DEA in Flexible Flow Shops
Publish place: 08th International Industrial Engineering Conference
Publish Year: 1391
نوع سند: مقاله کنفرانسی
زبان: English
View: 971
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC08_044
تاریخ نمایه سازی: 7 آذر 1391
Abstract:
This paper addresses to flexible flow shops environment with sequence dependant setup times and considers a scheduling problem with the aim of minimizing makespan andcumulative tardiness, simultaneously. In this paper we developed two new different ant algorithms, ACO and MMAS, based onData Envelopment Analysis (DEA). We considered each artificial ant as a Decision Making Unit (DMU) with two inputs, makespanand cumulative tardiness, and an output, equal to one for all of them. For developing the method we used the efficiency concept and efficient frontier of DEA
Keywords:
Authors
Hossein Ali Akbarpour
Marvdasht Branch, Islamic Azad University