The flowshop scheduling is one of the most well-studied production scheduling problems, that has gained wide attention in academic fields. Since a FSP with makespan criteria has been proved to be NP-hard in strong sense, producing good quality solutions by some heuristic techniques is very difficult due to large combinatorial search space. Exact methods such as the branch and bound method and dynamic programming take considerable computing time if an optimum solution exists. In such situations it is pragmatic to find a near optimal solution which can be obtained rather quickly. To overcome...