انجمن کامپیوتر ایران

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.