Project Almanac - Demonstration
Timetable scheduling is an integral part of the management of any organisation. Even though it seems to be a simple task, with the number of parameters accumulated, this task becomes highly complicated. This is further aggravated by the size of the organisation and the constraints get complicated. On top of this, campuses must efficiently manage their costs which makes it hard for them to determine whether the timetable they use is as cost-effective as possible. The most challenging aspect of the majority of scheduling issues in real life is getting a reliable timetable while completing a set of constraints.
The algorithm we propose is a bottom-up algorithm. We start from a basic timetable structure which is just a single slot. From this, we check if the requirements can be met with the existing configurations. For this, we use an algorithm named algorithm A. If we may identify all the possible outcomes. If not, we identify what constraints have to be changed using algorithm B and then we move on to identify the possible outcomes. Once this is done, we identify the optimum one out of them using the algorithm C. When we add a new parameter, we perform the check for each new slot one by one instead of all at once.
Learn more about the project at:
https://projectalmanac.org/
This video is also available on Odysee:
https://odysee.com/@AsankaSovis:a/Project-...