Automated Timetable Generation as a Constraint Satisfaction Problem (CSP)
تفاصيل العمل

Timetable generation is a classical Constraint Satisfaction Problem (CSP) where the goal is to assign lectures, rooms, professors, and time slots in a way that satisfies a set of hard and soft constraints. a dynamic timetable generator for their CSIT department, using data from an Excel sheet or a database (e.g., MySQL, SQLite) as input. The system should automatically construct a feasible timetable that meets all defined constraints.

شارك
بطاقة العمل
تاريخ النشر
منذ 3 أشهر
المشاهدات
69
المستقل
طلب عمل مماثل
شارك
مركز المساعدة