【作者】 苏志雄；

【导师】 乞建勋；

【作者基本信息】 华北电力大学（北京） ， 技术经济及管理， 2008， 硕士

【摘要】 资源限制项目排序问题是项目管理的核心内容。现有的解析法和启发式算法在解决该类问题时存在明显缺陷,如计算量大、难以达到最优、缺少普适性等。为了设计出能克服上述缺陷的新算法,先在假设资源无限时做“理想网络计划”,再根据实际资源限制把“理想网络计划”中的平行工序调整为顺序工序,从而使项目排序问题分解为多个平行工序顺序优化的子问题,减小了工作的难度。本文研究其中一类子问题——将L个平行工序中的2N个调整为N对顺序工序。利用CPM网络自身的特点和机动时间规律,在考虑前、后继工序约束条件下,设计出带松弛量的N元行偶顺序优化算法,并分析算法的时间复杂性。该子问题的解决为资源限制项目排序问题的彻底解决奠定了基础。更多还原

【Abstract】 Resource restricted project scheduling problem is a imporpant problem in project management. There are obvious defects when using analytic algorithm and heuristic algorithm to resolve the problem, such as need heavy calculation, difficult to get optimization, couldn’t be applied widely, and so on. For designing new algorithm without these defects, makes“perfect network planning”in case of resource limitless firstly, and then arrays parallel activities in“perfect network planning”to ordinal activities base on actual resource restricted, thereby decomposes project scheduling problem to many sub-problems for reducing difficulty. This paper researches one of sub-problems----arrays 2N activities from L parallel activities to N ordinal activities. When according restriction of preceding and succeeding activities, designs optimization algorithm of N Dimensions row-mate with relaxation quantity by utilizing rules of CPM network and characteristics of float, and analyzes the time complexity of the algorithm. The revoluation of the sub-problem could establish base for revolving rsource restricted project scheduling problem completely.更多还原