A　Discrete　Shuffled　Frog　Leaping　Algorithm　(DSFLA)　is　proposed　to　solve　the　No-Idle　permutation　Flow　Shop　scheduling　problems　(NIFS).　In　the　light　of　the　optimization　mechanism　of　general　SFLA,　the　algorithm　adopts　an　encoding　scheme　based　on　job　permutation　and　a　new　method　of　individual　production　to　extend　the　traditional　model　of　SFLA,　and　employs　the　simple　neighborhood　search　to　present　three　improvement　strategies.　The　experimental　results　show　that　the　proposed　algorithm　and　its　strategies　are　effective　and　efficient　in　different　scale　benchmarks　of　NIFS.