基于约束理论的混合复杂流水线规划调度算法

Planning and scheduling algorithm based on TOC for complex hybrid flow shop problems

针对可重入、批处理、准备时间长以及多目标混合流水生产线问题,给出了复杂生产线的一般描述,提出了一种基于约束理论的规划调度算法。整个算法框架建立在约束理论五步原则基础上,并通过目标规划的思想实现了多目标优化,为了验证算法解决复杂性的能力,通过估算瓶颈能力给出了生产线的上界以作比较。

For complex Hybrid Flow Shop (HFS) problems with reentrance, batch processing, setup-time and multiple optimization objectives, a general description for HFS was presented. And then a planning and scheduling algorithm based on Theory of Constraints (TOC) was proposed. The whole framework of algorithm was based on the five principle steps of TOC. The multiple-objective optimization was realized by using objective programming. The solution was analyzed by computational study. The upper bound was obtained by estimating bottleneck capacity.