Approche multi-Agents pour résoudre le problème d’emploi du temps

Abstract

The aim of this project is to explain a problem of university courses timetabling, this can be described as the allocation of resources (time slots, rooms,) to events (lesson, TD and TP) in condition to respect two types of constraints (Hard and Soft). The academic timetabling generation has been classified as NP-hard problem this means that it is unlikely that it will be possible to find fast Algorithm to solve this problems. So over the last three decades many approaches and models have been proposed like operational research, Algorithm genetic …etc to solve this problem, in this project we will try to generate a program of university courses timetable with multi-agents system.