Complexity of a one-to-one meeting scheduling problem with two types of actors - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of the Operational Research Society Année : 2015

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.
Fichier non déposé

Dates et versions

hal-01154425 , version 1 (21-05-2015)

Identifiants

Citer

Agnès Le Roux, Odile Bellenguez-Morineau, Christelle Guéret, Damien Prot. Complexity of a one-to-one meeting scheduling problem with two types of actors. Journal of the Operational Research Society, 2015, pp.online first. ⟨10.1057/jors.2014.135⟩. ⟨hal-01154425⟩
117 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More