Abstract: Proposes a hybrid algorithm that integrates constraint propagation technique and branch and bound algorithm to solve the hybrid flow shop scheduling problem.The critical stage is selected by the resource slack.Dynamicly adjusts the time window of each activity by embedding the time window and using constraint propagation in branch and bound.The lower bound is proposed to cut the search space and improve the optimization performance of branch and bound.Experiments show that the algorithm is promising.