01784nas a2200181   4500008004100000245009900041210006900140260000900209300001200218490000700230520114500237653002201382653002001404653002301424653002501447100001301472856011701485       2013                        eng d00aModeling resource-constrained project scheduling problem and its solution by genetic algorithm0 aModeling resourceconstrained project scheduling problem and its   c2013  a87 - 960 v113 aThe optimization of the resource-constrained project scheduling is an NP-hard problem. Complexity of the algorithm for solving this problem increases exponentially with the increase of resource constraints. Therefore, traditional optimization methods based on Excel tables cannot calculate the efficient allocation of resources, which will affect the scheduling of project management resources. The optimization problem like multiple resource-constrained project scheduling demands an optimization method based on genetic algorithm, which adopts the decimal encoding based on activity priority combined with the storage of the adjacency matrix in order to effectively solve unauthorized phenomenon in activity scheduling. It also adopts preemption mode of allocation of resources in activities to avoid conflict in resource allocation. Besides, we designs C language program that realizes heuristic genetic algorithm, which can find out the most excellent duration that meets the resource constraints through multiple iterations. Finally, the practical results indicate that genetic algorithm can quickly and efficiently solve this problem.10aGenetic Algorithm10aNP-hard problem10aProject scheduling10aResource constraints1 aChai, C.  uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879108012&partnerID=40&md5=6b5486fdec78b400439deebbf407f5b0