Research On Theory And Method Of The Sequential Optimization Of N Activity Pairs In The Condition Of Resource Constrained

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.