This is a workshop scheduler planner build during a seminar on Information Systems and Technology
The problem is as follows:
The task at hand is to schedule a multiday workshop, where each day is divided into timeslots and students has to be assigned to these timeslots. Each timeslot has a fixed capacity, and each student has a preference list of when they can work. We want to find a schedule where all students are assigned or all timeslots are filled, while minimizing each students overhead.
Objective function: Find a schedule
$S^$ is a solution consisting of a set of students $s$ and a set of timeslots $t$, $S^ = {s, t}$
Notes:
Hard constraint:
- A solution only exists if all timeslots has been filled or all students have been assigned.
Soft constraints:
- A student should have as little overhead (time between timeslots) as possible at the same day.
- Node and NPM
- Navigate to folder
- Run "npm install" in terminal
- Run "npm start" in terminal
- Navigate to localhost:8080
- Enjoy
To build production environment (assuming the above steps have already been followed)
- Run "npm run build"