How to solve a timetabling problem by negotiation? - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

How to solve a timetabling problem by negotiation?

Résumé

Timetable creation has usually been tackled as a constraints satisfaction problem (CSP). In this article, we propose a new, original and promising way to create timetables: negotiation. Using negotiation allow users to establish their timetable according to their preferences and without revealing their constraints. The problem we tackle here is to create a timetable involving teachers and groups of student. Multi-agent systems seem particularly of interest for this problem as different entities have to negotiate together.
Fichier non déposé

Dates et versions

hal-00451609 , version 1 (29-01-2010)

Identifiants

  • HAL Id : hal-00451609 , version 1

Citer

Philippe Mathieu, Marie-Hélène Verrons. How to solve a timetabling problem by negotiation?. The 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT 06), Aug 2006, Brno, Czech Republic. pp.502-505. ⟨hal-00451609⟩
148 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More