Automated Timetabling System for University Course

Rane, Mrunmayee V.; Apte, V.; Nerkar, Vishakha N.; Roja, M. Mani; Rajput, K.Y.

doi:10.1109/esci50559.2021.9396906

Cited by 8 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, at most institutes, this time-consuming and difficult issue is handled manually by a single person or a small group of people with the purpose of providing feasible timetables. Due to a lack of efficiency in the development of timetables, this may result in wastage of time for faculties and concerned members [3]. To get feasible timetables, a set of courses are allocated to a set of students with multi-unit demand in which to be called a classic multi-unit resource allocation problem, or equivalently, a one-sided many to-many matching problems.…”

Section: Introductionmentioning

confidence: 99%

School of Computing Course Slots Distribution System

Xuan,

Mohamed Din

2023

MARI

View full text Add to dashboard Cite

Every year there will be thousands of students enrolling into universities. Before the starting of every semester, the head of department in all schools have a very important job which is deciding the numbers of classes/slots to be opened for every course and submit them to the Academic Affairs (HEA) office. The number of classes/slots for each course is determined based on the number of students enrolled for the course. Knowing the accurate number of classes/slots to be opened could help in allocating suitable lecture halls for each class/slot. This would then ensure the lecture halls are used to the fullest and the students would have a comfortable learning environment. The traditional method of counting the number of classes/slots manually course by course is rather troublesome and time consuming. Therefore, a web-based School of Computing (SOC) Course Slots Distribution System is developed to help solve the problem. The system aims to distribute the classes/slots for each course in BSc in Information Technology and BSc in Computer Science according to the number of students enrolled for the course. The system is developed using HTML, PHP and CSS. The system was then tested by the representatives of SOC management and evaluated based on user acceptance using an online survey platform – Google Form. The result of the evaluation suggested that the SOC Course Slots Distribution System is usable to assist the head of department of every school in Universiti Utara Malaysia (UUM) to calculate the number of classes/slots to be opened for each course efficiently. The respondents also suggested for the system to have lab allocation as well for further improvement. With the help of this system, the workload of head of departments will greatly decrease.

show abstract

Section: Introductionmentioning

confidence: 99%

School of Computing Course Slots Distribution System

Xuan,

Mohamed Din

2023

MARI

View full text Add to dashboard Cite

show abstract

“…The manual management of student project evaluations is both time-consuming and inefficient [3]. For instance, creating an evaluation schedule involving a large number of evaluators and students is a laborious task [3,4]. This significantly impacts the efficiency of the FYP coordinator, as they must manually handle and cross-reference all schedules with the evaluators' timetables.…”

Section: Introductionmentioning

confidence: 99%

Efficiency and Accuracy of Scheduling Algorithms for Final Year Project Evaluation Management System

Loo,

Toh,

Ab. Nasir

et al. 2023

MEKATRONIKA

View full text Add to dashboard Cite

Scheduling algorithms play a crucial role in optimizing the efficiency and precision of scheduling tasks, finding applications across various domains to enhance work productivity, reduce costs, and save time. This research paper conducts a comparative analysis of three algorithms: genetic algorithm, hill climbing algorithm, and particle swarm optimization algorithm, with a focus on evaluating their performance in scheduling presentations. The primary goal of this study is to assess the effectiveness of these algorithms and identify the most efficient one for handling presentation scheduling tasks, thereby minimizing the system's response time for generating schedules. The research takes into account various constraints, including evaluator availability, student and evaluator affiliations within research groups, and student-evaluator relationships where a student cannot be supervised by one of the evaluators. Considering these critical parameters and constraints, the algorithm assigns presentation slots, venues, and two evaluators to each student without encountering scheduling conflicts, ultimately producing a schedule based on the allocated slots for both students and evaluators.

show abstract