Universities and schools aim to provide high quality lesson schedules to their teachers and students. Depending on room capacity and availability, school timetabling decides when and where a lecture takes place. Optimizing this planning problem with a constraint solver AI improves teacher and student satisfaction by reducing commute and gap hours while adhering to other constraints such as conflicting lessons, teacher availability, room availability and room capacity.
OptaPlanner is the leading Open Source Java™ AI constraint solver to optimize maintenance scheduling, adhering to skill, capacity, SLA’s and other constraints.
OptaPlanner is a lightweight, embeddable planning engine. It enables normal Java™ programmers to solve optimization problems efficiently. It is also compatible with other JVM languages (such as Kotlin and Scala). Constraints apply on plain domain objects and can call existing code. There’s no need to input constraints as mathematical equations. Under the hood, OptaPlanner combines sophisticated Artificial Intelligence optimization algorithms (such as Tabu Search, Simulated Annealing, Late Acceptance and other metaheuristics) with very efficient score calculation and other state-of-the-art constraint solving techniques.
Run the school timetabling quickstart.
Want to talk to the experts? Red Hat offers certified binaries with enterprise consulting. Contact optaplanner-info for more information.