The task of assigning multi-skilled workers to concurrent projects is considered.
We present a mixed-integer linear program that aims at forming small project teams.
We outline valid inequalities that support a commercial branch-and-cut solver.
We prove that the problem is strongly NP-hard and devise three heuristics.
A computational analysis reveals the heuristic that performs best.