Abstract: A constraint satisfaction optimization model is established for the problem of earliness/tardiness Job Shop scheduling problem.A hybrid algorithm combined with constraint satisfaction and tabu search is proposed.Based on constraint satisfaction，an entirely feasible scheduling is obtained by constraint propogation technology and heuristic repair method and is regarded as initial solution for tabu search algorithm.Current solution is optimized by neighborhood transformation on a critical path.The final optimizal solution is improved by adopting a global neighborhood swapping strategy.The data experiments show that the hybrid algorithm is feasible and effective.