Contributions of Inclusion-Exclusion to exact or approximate solution of scheduling problems

This thesis is aimed at sutying NP-hard scheduling problems. Exact or approximate exponential methods shall be proposed to solve such problems. Many scheduling problems are permutation problems, in which a solution can be represented by a permutation on integers. Some promising techniques in this situation, as inclusion-exclusion, subset convolution or other mathematical tools shall be studied.