Skip to content

ihababdelkareem/Classroom-Scheduling-CSP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CSP-Scheduling

Input:
A text file describing the courses to be given and a list of professors and their preferred courses. Output: A timetable for each professor satisfying basic hard constraints:

  • no room conflicts
  • no timeslot conflicts
  • Limited Hour-Load
  • No Professor Has 4 Consecutive Lectures

The User gets to pick the soft constraint to fulfil from the following options:

  • Make a day off for each Professor
  • Minimize the number of early ( 8 AM ) Lectures
  • Minimize the number of lectures outside the IT Building

Alt text

Authors

Ihab Abdelkareem

Bader Anini (@baderanini)

About

University Classroom Scheduling Using CSP and Genetic Algorithms to Satisfy Hard and Soft Constraints

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published