Job-Shop Scheduling Using Hybrid Shuffled Frog Leaping
Publish place: 14th annual International CSI Computer Conference
Publish Year: 1388
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,604
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CSICC14_042
تاریخ نمایه سازی: 24 خرداد 1388
Abstract:
Job-shop scheduling problem is demonstrated as one of the NP-complete problems. To solve this problem, we propose two types of hybrid shuffled frog leaping algorithm. Hybrid algorithms are generated by combining the shuffled frog leaping and a local search method. Also a new local search method by combining two other simple local searches is proposed. The obtained results demonstrate that our proposed hybrid algorithms have a better performance than their nonhybrid competitors. Also a comparison among proposed hybrid shuffled frog leaping and hybrid genetic algorithms demonstrate that the hybrid shuffled frog leaping algorithms can be generated a better schedule than their genetic algorithm competitors. A caparison of the best obtained results with the results reported in the considered literature shows that our proposed algorithms have a comparable performance
Keywords:
Authors
M Alinia Ahandani
University of Tabriz, Tabriz, Iran.
N Pourqorban Shirjoposht
University of Tabriz, Tabriz, Iran.
R Banimahd
Sahand University of Technology, Sahand, Iran