Student Scheduling Problem At Université de Technologie de Compiègne

Abstract : Students at Université de Technologie de Compiègne (UTC) are allowed to design their curriculum by selecting courses from large course pools. There are today six engineering degrees (high-level master). The assignment is performed using a heuristic designed some years ago. The number of students, courses and curricula increased over the years and this heuristic reached its limit. Time-consuming manual post-processing is required to obtain the individual planning for each student not assigned by the heuristic. We propose a MIP model to maximize the number of assigned students while managing limited resources. Optimal solutions are achieved for each instance and are strictly better than those computed by the heuristic. We investigated the impact of clique inequalities on computing times.
Type de document :
Communication dans un congrès
Multidisciplinary International Conference on Scheduling : Theory and Applications, Aug 2015, Prague, Czech Republic. pp.871-875, 2015, <http://www.schedulingconference.org/>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01253887
Contributeur : Taha Arbaoui <>
Soumis le : lundi 11 janvier 2016 - 15:00:39
Dernière modification le : lundi 28 mars 2016 - 22:52:52

Identifiants

  • HAL Id : hal-01253887, version 1

Collections

Citation

Taha Arbaoui, Abdelhadi Azouni, Jean-Paul Boufflet, Aziz Moukrim. Student Scheduling Problem At Université de Technologie de Compiègne. Multidisciplinary International Conference on Scheduling : Theory and Applications, Aug 2015, Prague, Czech Republic. pp.871-875, 2015, <http://www.schedulingconference.org/>. <hal-01253887>

Partager

Métriques

Consultations de la notice

128