A Hybrid Shuffled Frog Leaping Algorithm for Solving No_Idle Permutation Flow Shop Scheduling Problems

Abstract:

Article Preview

This paper presents a novel hybrid shuffled frog-leaping algorithm (HSFLA) for solving the no_idle permutation flow shop scheduling problems(NIFS) with the criterion to minimize the maximum completion time( makespan). First, the algorithm employs insert- neighborhood-based local search to enhance the searching ability. Second, it adopts roulette wheel selection operator to generate the global best frog in the early stage of the evolution which can expand the searching solution space. The experimental results show that the proposed algorithm is effective and efficient for different scale benchmarks of NIFS .

Info:

Periodical:

Edited by:

Elwin Mao and Linli Xu

Pages:

110-115

DOI:

10.4028/www.scientific.net/AEF.1.110

Citation:

Y. M. Wang et al., "A Hybrid Shuffled Frog Leaping Algorithm for Solving No_Idle Permutation Flow Shop Scheduling Problems", Advanced Engineering Forum, Vol. 1, pp. 110-115, 2011

Online since:

September 2011

Export:

In order to see related information, you need to Login.

In order to see related information, you need to Login.