摘要
论文从定量的角度,分析了项目群中一种资源以及多种资源的"多任务"情形,对关键链进度计划问题建立了数学模型,并引入遗传算法,使"多任务"现象转化成具有相应优先权的排序基因或染色体,对最优化进度和延迟成本构建了相应的算法.最后,通过算例证实此方法可以得出最优排序,同时能提供较多的替代方案,为关键路径法演变成关键链技术提供了定量支撑.
Critical Chain multiple project scheduling management mainly applies the Theory of Constraints to solve the negative affection of multi-task and uneertain factors to project scheduling. The paper analyses multi-task of one resource and multi-task of many resources in a group of projects, and sets up the mathematics model of Critical Chain scheduling problems. It brings genetic algorithm, and changes the problem of multi-task into the chromosome or the sequence of genes with the corresponding priority. The corresponding algorithm is propsed to optimize the objective of time and tardiness cost. Finally, the empirical research shows the method can educe the optimal sequence, and provide many alternative schedules. It quantifieationally supports Critical Path Method can evolve into Critical Chain Method.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2007年第9期54-60,共7页
Systems Engineering-Theory & Practice
基金
国家博士后科学基金(2005037516)
关键词
关键链技术
项目进度
资源冲突
遗传算法
critical chain method
project scheduling
resource conflict
genetic algorithm
