Robust resource constrained project scheduling: Integer programming approaches

The Resource Constrained Project Scheduling Problem is a classical combinatorial optimization problem with many important applications. In the last decades, only incremental improvements in computational solvers for this problem were obtained and small problem instances with only 30 tasks remain unsolved. The solution of more realistic problem versions, such as the Robust Resource Constrained Project Scheduling Problem is still harder. This project considers the development of a new generation of exact solvers for the deterministic and robust versions of this problem. The methodology for the development of these solvers was already recently successful when applied to other hard combinatorial optimization problems, such as those arising in timetabling and vehicle routing and includes the design of stronger integer programming formulations and computational methods to handle them.

Keywords:integer programming

Disciplines:Applied mathematics in specific fields