考虑约束松弛的柔性流水调度研究

Research on Flexible Flow Shop Scheduling with Relaxation Constrains

针对柔性流水车间作业调度问题,考虑加工批量约束松弛和瓶颈工序顺序松弛2种情形,抽取出相应的新型柔性流水车间调度问题,建立了最小化最大完工时间的数学模型,提出了改进的单亲遗传算法,进行了优化求解,得到了不同约束松弛情况下的最优调度方案。通过算例仿真,验证了所提方法的有效性。

Aiming at a new flexible flow shop scheduling（ FFSS） problem,it presents two relaxation constrains including process batch and sequence permutation,establishes the new mathematical model with the objective of minimizing the maximal completion time of FFSS,proposes a revised partheno genetic algorithm（ PGA） and realizes scheduling optimization. Based on the proposed PGA,it obtains the different scheduling solution corresponding to the different relaxation constraints,and simulates the numerical testing. The results demonstrate the feasibility and effectiveness of the proposed method.