Solves a scheduling/roster problem (gym class rosters, dance-school timetables, restaurant shift plans) with OR-Tools CP-SAT: assigns resources to slot demands honoring availability, tags, and constraints (no double-booking, max-per-day, min-rest, forbidden/required pairs, fixed assignments, max total hours), optimizing the requested objective. Infeasible inputs come back with the specific conflicting demands/constraints named.

Payment Options