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.

摘要： 针对等待时间受限的准时制混合流水车间调度问题，建立其约束满足优化模型。考虑到模型具有二元变量的复杂性特点，将原问题分解为多能力流水车间调度和机器指派两个子问题。在对多能力流水车间调度问题的约束满足优化求解过程中嵌入邻域搜索，从而提高算法的收敛性。数据实验表明模型和算法是可行和有效的。