Improved tabu search is proposed to solve the multi product continuous manufacturing facilities schedul ing problem. The problem is formulated as a mixed-integer linear programming (MILP) model. The mathematical model h as a linear objective function to be maximized. The prob lem is NP-hard and finding an optimal solution effi ciently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The com putational results are compared to manual experimental results in the plant and show that the effectiveness and a pplicability of the proposed methods.