What this package is
staffing-scheduling is a hard-constraint feasibility engine for shift-based staffing. It answers
whether every required demand unit can be assigned to a qualified, available agent without violating hard
rules.
Recommended flow
- Build domain input.
- Compile to the solver boundary.
- Solve for feasibility.
- If infeasible, regroup primitive failures back into domain explanations.
The package is about feasibility, not optimization or ranking among feasible schedules.
What comes back
| Result | Meaning |
|---|---|
| Feasible | A complete assignment set. |
| Infeasible | Regrouped explanations in domain terms, centered on failed needs. |
| Metadata | Site and line context is preserved where it matters. |
Supported at a glance
- Exact-match qualifications with validity windows
- Availability and time off as hard eligibility
- Shift-pattern compatibility and rest rules
- Rolling utilization max
- Site- and line-aware coverage regrouping
What it does not do
- No optimization or preference ranking
- No partial-fill success mode
- No substitution lattice
- No production sequencing or line balancing