OR-Tools / CP-SAT Scheduling Algorithm Review (One-Time)

Skills Tags: Google OR-Tools, Constraint Programming, Python, Operations Research, Algorithm Design, Scheduling Optimization Job Description: We’re a pre-launch SaaS startup (AI-Orbit) building an AI-powered scheduling engine for small businesses. The engine uses Google OR-Tools CP-SAT solver to coordinate multi-party meetings across calendars and time zones with full AI autonomy. The scheduling algorithm code is written in Python. We need an experienced constraint programming / operations research specialist to review the solver logic before we hand it to our production development team. Scope: • Review CP-SAT constraint model for correctness and completeness • Validate working hours, timezone, buffer, priority, and back-to-back constraints • Identify edge cases (DST transitions, oversubscribed calendars, circular dependencies) • Assess scalability to 50+ events per user • Deliver written assessment: pass/fail per constraint + recommendations Required: • Hands-on OR-Tools (CP-SAT preferred) or equivalent (CPLEX, Gurobi, MiniZinc) • Scheduling/resource allocation optimization experience • Ability to read and assess Python constraint logic Preferred: • Calendar/scheduling domain experience • Published OR work or INFORMS membership • Multi-timezone coordination experience This is a review-only engagement — you are not writing the code, you are validating it. Please include a brief note about your constraint programming experience when you apply.