Code
01D01418
Duration
01 October 2018 → 28 February 2022
Funding
Regional and community funding: Special Research Fund
Promotor
Fellow
Research disciplines
-
Natural sciences
- Applied mathematics in specific fields not elsewhere classified
- History and foundations not elsewhere classified
- Statistics not elsewhere classified
- Numerical methods not elsewhere classified
-
Social sciences
- Business administration and accounting not elsewhere classified
Keywords
Project scheduling
complexity measures
combinatorics
exact algorithms
Project description
We provide an integrative framework to study the complexity of the resource-constrained project scheduling problem by linking it to the mathematical field of combinatorics. Three dimensions are studied: the network structure, the resource constraints and the objective function. Based on these insights, a fundamentally different exact solution algorithm will be proposed.