Random Allocation Of Least Saturated Degree First Heuristic For Solving Curriculum Based
Quality Publication | Affordable Price | Happy Authors
Random Allocation Of Least Saturated Degree First Heuristic For Solving Curriculum Based Tertiary Institution Course Timetabling Problem
Timetabling is a task scheduling problem whereby available resources are assigned to tasks under existing constraints. Educational timetabling is an activity that is carried out in every semester in educational institutions. There are two instances in the educational timetabling problem: course and examination timetabling. The paper applies a “Least Saturated Degree First” heuristic in tackling the Tertiary Institution Course Timetabling Problem (TICTP). A course selected based on ´least number of rooms” is randomly allocated at a period and in a room in order to create a feasible timetable. The hard constraints applied are the same as those used in the ITC 2007 competition, but the DownloadViews: 176

Why Researchjournali?

Instant Paper Submission
Author Loyalty Reward
No Copyright Transfer
70% Less Publication Fee

You may also like to read


Cybersecurity At The Heart Of Technological Apogee And Future Development

Development Of Microcontroller-based Real-time Control System For Home Appliances

Comparison Of Activation Functions For Nse Stock Price Prediction

Intelligent Systems Applications: A Review Of State Of Art

Towards Implementing An Hrms, A Case Study Of The University Of Jos, Bursary Department

What Computer System To Implement For The Identification And Monitoring Of Evolution Of The Population