Abstract： In classical resourceconstrained project scheduling problems, the job processing times are assumed to be constant parameters. However, in many practical cases, the processing times depend on the resource allocated to the job. In this paper, the resourceconstrained project scheduling problem was introduced with resource allocation dependent processing time to minimize the duration of the project. A model was established and a genetic algorithm was proposed to solve the problem. To improve the ability of the algorithm, a 1opt based local search scheme and a 2opt based local search scheme were introduced.The related properties between different job combinations and the objective of the problem were summarized and proved. Based on these properties, the approach  for selecting effective job combinations was established, which greatly improved the efficiency of the algorithm in local search. Comparative computational results reveal that the algorithm proposed in this paper can solve the problem effectively.