Complexity of a one-to-one meeting scheduling problem with two types of actors
Résumé
This article deals with a new scheduling problem that arises in the organization of one-to-one meetings in parallel.
We first introduce applications of one-to-one meeting scheduling problems. Then, we give an overview of the
relevant complexity results. We then prove several complexity results for different versions of the problem.