摘要
针对多个IT项目的人力资源调度问题,根据其在时间和人员方面的特殊要求,可以将项目的演进时间划分为相等的时间片段,然后根据特定时间片段内的活动与可选人员之间的关系,建立相应的人员调度方案搜索树.将所有时间片段内的搜索树按顺序连接后,可以得到总的方案树,并列出所有的方案,然后根据不同方案下得到的平均提前完工率和提前完工率方差,找到最优解.又为该搜索算法添加了启发规则,使搜索空间急剧收缩,极大提高了搜索效率.基于该算法的特殊性,可以将其用于求解许多具有与上述问题类似条件的资源调度问题.本研究通过实例发现,根据运算中的特殊规律,该算法还具有进一步提取启发规则的潜力.
This paper deals with the human resource scheduling problem of multiple IT projects.According to its specific requirements on time and personnel,the duration of the whole development process can be divided into equal-length time slices.Based on the relations among activities and personnel in a certain time slice,the search tree of personnel scheduling solutions can be constructed.By connecting all the search trees sequentially from all the time slices,the solution tree for the whole problem can be generated and all the solutions can be listed.Then,based on the average of advanced completion rate and the variance of advanced completion rate,the optimal solution can be found.By adding heuristic rules to this algorithm,the searching space can contract rapidly,and the searching efficiency can be enhanced greatly. In view of the particularities of this algorithm,it can be applied to many generalized resource scheduling problems that possess similar conditions with the problem described above.After applying this algorithm to a mock example,some regular patterns emerged,showing the potential that further heuristic rules can be extracted.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2012年第4期731-737,共7页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(701071041
71071042)
黑龙江省自然科学基金(G2007-02)
关键词
多项目
资源调度
启发式搜索
时间片段
multiple projects
resource scheduling
heuristic search
time slice
