中文摘要：

带有等待时间受限约束的混合流水车间调度问题具有强NP难的特性，而实际生产过程中产品需求时间以及机器加工时间等各种不确定性因素，更为求解此类问题带来了复杂性和挑战。通过探索这类问题的特征，建立了两阶段随机规划模型，开发了L型切面的求解算法，在目标为成本期望最小的情况下，给出了这类问题的近似最优调度解。建立的模型针对于生产过程中的稳态，以更好地适应实际生产的需要。通过对算法性能进行理论分析和实验验证，证明了该算法的有效性。

英文摘要：

The hybrid flowshop problem with limited waiting times is a NP-hard problem. Stochastic parameters, such as uncertain product due dates and uncertain processing times of machines,make it more ehallengeable to solve. To address this problem, a two-stage stochastic programming model with uncertain parameters is designed and an L-shaped algorithm is developed to solve this model. The focus is mainly on the steady state in the production process to accommodate the practical requirement. Theoretical analysis and numerical experiments demonstrate the efficiency of the proposed algorithm.