最短工期问题是重复性项目调度中的一类常见问题。本文首先根据不同类型控制工序工期与总工期之间的变化关系,提出并证明了总工期的计算公式,给出了逆控制工序存在的必要条件。然后提出了最短工期问题的优化策略,即只需对所有满足逆控制工序必要条件的工序系进行执行模式的选择,而其余工序系直接选择最快执行模式。最后以该策略为基础设计了新的遗传算法。算例分析表明,与现有的其它算法相比,极大地简化了计算量,提高了计算效率。
In repetitive project scheduling,usually it is needed to minimize the project duration when each activity is given some available productivities.First,two theorems about repetitive scheduling method are presented in this paper,where one is used to determine the calculation formula of the project duration,and another proposes the necessary conditions for any activity become the backward controlling activity.Second,an optimization model based on these two theorems is proposed to minimize both the project duration and the total interruption days.Last,the performance of the proposed algorithm is validated by comparing with other existing algorithms.