摘要
从n个平行工序中选出2m个工序调整为对总工期影响最小的n个顺序工序对是一类典型的资源限制项目排序问题.为了给该类问题的解决提供理论依据和方法,本文针对如何从n个平行工序中选出八个工序调整为四个顺序工序对的最优化决策问题,结合序偶亏值定理、行偶亏值定理、标准行偶定理和规范行偶定理给出最佳行偶定理,并以此为基础提出标准规范法,分析其正确性.最后,通过算例实现对算法的应用.
It is one of resource constrained project scheduling problems,which selecting 2m activities from n parallel activities to make m ordinal activities pairs and minimize the affection on the project duration.In order to provide theories and methods for such problem,in this paper,we study the optimization problem that how to select eight parallel activities from n ones to make four ordinal activities pairs.Based on present theory,optimal row-mate theorem is given,and founded on them,standard-criterion algorithm is designed and proved theoretically.Finally,an example is given to illustrate the feasibility of the algorithm.
出处
《运筹学学报》
CSCD
2010年第4期112-120,共9页
Operations Research Transactions
基金
国家自然科学基金资助项目(70671040)
教育部博士点基金资助项目(20050079008)
关键词
运筹学
项目管理
优化
标准规范法
亏值
Operations research
project management
optimization
standard-criterion algorithm
tardiness
