Aiming at the problem of ant colony algorithm for solving Job一shop scheduling problem. Consideringthe complexity of the algorithm that uses disjunctive graph to describe the relationship between workpieceprocessing. To solve the problem of optimal solution，a generalized ant colony algorithm is proposed. Under thepremise of considering constrained relationship between equipment and process，the pheromone update mechanismis applied to solve Job-shop scheduling problem，so as to improve the quality of the solution. In order to improvethe search efficiency，according to the state transition rules of ant colony algorithm，this paper makes a detailedstudy on the selection and improvement of the parameters in the algorithm，and designs the pheromone updatestrategy. Experimental results show that a generalized ant colony algorithm is more feasible and more effective.Compared with other algorithms in the literature，the results prove that the algorithm improves in computing theoptimal solution and convergence speed.