Skip to content
#

cp-sat

Here are 61 public repositories matching this topic...

Hybrid metaheuristic–RL framework for multi-objective university course timetabling (UCTP). NSGA-II + PPO/DQN + Multi-Armed Bandit operator selection + CP-SAT decomposition repair + Kempe/Ejection chain neighborhoods.

  • Updated Jun 22, 2026
  • Python

A spec-kit extension that uses constraint programming (Google OR-Tools CP-SAT) to produce provably optimal task-to-agent assignments with DAG precedence, hallucination-aware capacity caps, file-conflict avoidance, stochastic durations, online replanning, and interactive HTML output.

  • Updated Jun 22, 2026
  • Python

A modular Python implementation of a course timetabling solver using OR-Tools CP-SAT. Built to replace an OpenSolver prototype with improved flexibility, structured I/O via Excel, and staged optimization (courses → instructors → times → rooms).

  • Updated Sep 3, 2025

Improve this page

Add a description, image, and links to the cp-sat topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the cp-sat topic, visit your repo's landing page and select "manage topics."

Learn more