Hybrid algorithm for project scheduling with capacity constraint*

Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling problem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.