Abstract
The faculty course scheduling problem is concerned with assigning time slots to courses while taking into consideration some departmental and university constraints and instructor preferences. The problem also aims at optimizing the performance criteria and distributing the courses evenly among the available time slots. The problem is a classic scheduling problem and has received some research during the past few years due to its wide use in academic institutions. Most of the proposed solutions were based on local search techniques. In this paper, we present a complete approach to solving the course scheduling problem using Boolean Satisfiability (SAT). Experimental results show the effectiveness of the proposed approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
