| Article ID: | iaor201527352 |
| Volume: | 66 |
| Issue: | 10 |
| Start Page Number: | 1730 |
| End Page Number: | 1741 |
| Publication Date: | Oct 2015 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Guret Christelle, Bellenguez-Morineau Odile, Le Roux Agns, Prot Damien |
| Keywords: | combinatorial optimization, programming: multiple criteria |
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.