Abstract: A constraint satisfaction optimization model is established for the problem of just in time hybrid flowshop scheduling with limited waiting time.Considering the problem’s complicated characteristic of having binary variables，this paper decomposes it into a Multiple Capacitated Flowshop Scheduling（MCFS） problem and a machine allocation problem.During the process of solving the MCFS problem，a local search is embedded into the procedure of constraint satisfaction optimization so as to improve the convergence of the algorithm.The data experiments show that both the model and algorithm are feasible and effective.