Title

Technical Papers Session IV: Customizable algorithm for university timetabling and scheduling

Abstract/Description

University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.

Location

Lecture Hall A (Aman Tower, 12th floor)

Session Theme

Technical Papers Session IV - Artificial Intelligence

Session Type

Parallel Technical Session

Session Chair

Engr. Parkash Lohana

Start Date

17-11-2019 3:20 PM

End Date

17-11-2019 3:40 PM

Share

COinS
 
Nov 17th, 3:20 PM Nov 17th, 3:40 PM

Technical Papers Session IV: Customizable algorithm for university timetabling and scheduling

Lecture Hall A (Aman Tower, 12th floor)

University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.