A heuristic algorithm is presented for solving the minimum makespan problem of flowshop scheduling.In the algorithm,the scheduling rules is used to create the initial solution and then the tabu search algorithm is applied to improve the last solution.The simulation experiment result proves the application and super application values of the algorithm.