基于析取图的非周期可重构流水作业的建模与优化

Disjunctive Graph Based Acyclic Reconfigurable Flow Shop Modeling and Optimization

针对可重构制造这一新的制造模式,研究一类非周期可重构流水作业的建模与优化问题.非周期可重构流水作业由析取图模型表示,基于析取图模型,选取完成所有作业的最大时间Cm ax作为优化的目标,建立相应的混合整数规划求解置换、一般和无缓冲区3种情况下非周期可重构流水作业的最优配置和最优调度.

The problem of acyclic reconfigurable flow shop modeling and optimization is studied for the new manufacturing paradigm-reconfigurable manufacturing system. The acyclic reconfigurable flow shops can be modeled as disjunctive graphs, based on which mixed-integer programs are established to find the optimal configuration and optimal schedule under three different cases （i. e. , under permutation, general and blocking cases） with makespan Cmax minimization.