Resource Constrained Project Scheduling Problem (RCPSP) is an interesting problem in engineering practice, as more profits can be realized in the process of minimizing the make-span of the project given resources constraints as well as a certain sequence of tasks dependency. Our project focuses on solving it using 3 different optimization algorithms, including zero-one programming, simulated annealing, and genetic algorithms. Convergence diagrams of different approaches are presented, and the parameters involved in each solution are compared and discussed in this report to get a better understanding of these methods.     «

Resource Constrained Project Scheduling Problem (RCPSP) is an interesting problem in engineering practice, as more profits can be realized in the process of minimizing the make-span of the project given resources constraints as well as a certain sequence of tasks dependency. Our project focuses on solving it using 3 different optimization algorithms, including zero-one programming, simulated annealing, and genetic algorithms. Convergence diagrams of different approaches are presented, and the pa...     »