Implement TimeSlot Structure

seng499-company2 / algorithm1

MIT License

1 stars 1 forks source link

Implement TimeSlot Structure #33

Open kianapaz opened 2 years ago

kianapaz commented 2 years ago

User Story

As a developer using CSP, I would like to have data structures containing the time slot structure in which to schedule the courses.

Description

A python dictionary containing the possible times courses can be scheduled, i.e. if TWF (50 mins), MR (80 mins) and any day is a (170 mins). Ideally a script that can store all the conflicting times lots.

Acceptance Criteria

[x] A dictionary containing the time slots, days and time of day
[x] All possible times for those days
[x] A dictionary containing all the conflicting time slots (possibly as a script that runs each time algorithm 1 is called)
[x] All time slots fit between the required time start/end of the day (8:30 AM to 9:50 PM).

Additional Resources

Add attachments, external links, etc here.

kianapaz commented 2 years ago

initial time slot structure using date time and dictionaries
Contains the time of day and day (MR, TWF, ANY)
Currently working on the conflicting times lots for the constraints. Using date time to dynamically find the times, and looking at the conflicting times.
Looking into what times are missing, as it's adding the 50 mins, 80 mins and 170 respectively.

kianapaz commented 2 years ago

On transform_data branch:

A time slot configuration dictionary is created and used at runtime that determines all possible time slots. Including TWF, MTh and Any day. The any day begins at 1pm, because it is advised not to rely on 3 hour time blocks, as core courses are never in a 3 hour time block.
A hard constraint is configured to ensure the time slots don't conflict, this was chosen over a dictionary of conflicts, but can be reconsidered if this limits the runtime.
The time slot conflict hard constraints is also used to ensure no courses a professor is teaching will overlap.
A test was included.

kianapaz commented 2 years ago

Time slots are now implemented in the CSP2 algorithm.

It takes into account that TWF and MTh are preferred times, and the any day time slot is a last resort.
There is a test implemented for the time slots and if there is conflicting times.
The time slots are in a dictionary, with an integer id assigned.