出版社：University of Tehran Electronic Journals Database
摘要：The scheduling problems are the non-polynomial problems-hard (NP-Hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.In this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase the rate of developed imperialist competetive algorithm by remove the unfeasible search space. The proposed algorithm is tested on a set of standard problems PSPLIB Library and the performance is compared with some existing methods. Test results of the proposed algorithm show effectiveness and feasibility of algorithm to solve standard problems. To evaluate the performance of algorithms for solving problems in real field, two projects that carried out by the Quds Force (supplies petrochemicals project in Kermanshah, Kermanshah Petrochemical Project Setup Utility) are modeling in RCPSP and solved by using the proposed algorithm.
