What is this?
A staff rostering tool. Describe the shifts, the people, the days each person can work which shifts, their leave and the most hours each may work in the period, and it finds a roster that covers every shift and spreads the work as evenly as possible: the busiest person works the fewest shifts that any valid roster allows. It is an exact optimisation (the HiGHS solver, running in your browser as WebAssembly), the same model as this project's Python solver, whose staff CSV it imports. Nothing is uploaded or stored: save your setup as a file to keep it.
Shifts
Each shift is needed every day of the period, by as many people as "Needed" says.
| Shift | Start | End | Hours | Needed | Remove |
|---|
Staff
Pick a person to edit their availability. "Max hours" is for the whole period.
| Name | Max hours | Remove |
|---|
No staff yet: add a person, import a CSV or load the example.