A hybrid partheno-genetic algorithm approach to a general resource-time optimization problem

In this paper, we propose a hybrid partheno-genetic algorithm approach to solve a general resources constrained and shortest time optimization problem. Since the problem is NP complete, it is very hard to find a feasible solution, especially in large problems, let alone the optimal solution. According to the characteristics of the problem, the algorithm we introduce is integrated with heuristic rules. Theoretical analysis shows that the algorithm has global convergence and the application provided demonstrates its effectiveness.