摘要
Resource-Constrained Project Scheduling Problem with Multiple Routes (RCPSP-MR) for flexible project activities is a generalization of the RCPSP in which, for the implementation of each flexible activity in the main structure of the project, several exclusive sub-networks are considered. Each sub-network is regarded as a route for flexible activity. The routes considered for each flexible activity are varied in terms of: 1) the number of activities requiring to be executed; 2) the precedence relationships between activates; 3) allocation of different renewable and nonrenewable resources to each activity; and 4) effectiveness in duration and cost of project completion. In this study, first, a new mathematical formulation for RCPSP-MR was developed. Then, two solving approaches based on Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) were adopted to minimize the costs of project completion. To evaluate the effectiveness of the proposed approaches, 50 problems (in very small, small, medium, and large-size test problems) were designed and solved. Finally, comparisons were made between the results. Computational results showed that the proposed GA would generate high-quality solutions in a timely fashion.
学科与关键词
文献加载失败,请重试
重试