An AI constraint solver for Java and Kotlin to optimize routing and scheduling.
Optimize vehicle routing, employee rostering, and complex planning problems.
Timefold Solver is an open-source AI constraint solver designed for Java and Kotlin developers. You can use it to build planning applications that solve vehicle routing, task assignment, and employee scheduling problems.
It solves complex planning and optimization problems using constraint programming algorithms. Developed by the original OptaPlanner team, it targets operational planning challenges like school timetabling, cloud optimization, and maintenance scheduling.
It suits Java and Kotlin developers building enterprise planning and scheduling software. It does not suit teams working outside the JVM ecosystem or those needing a no-code drag-and-drop scheduler.
Solve complex combinatorial planning problems programmatically.
Optimize routing problems out of the box with dedicated algorithms.
Build shift schedules and task assignments matching operational constraints.
Integrated directly into Java and Kotlin codebases using Maven.
The Community Edition is free and open source under the Apache-2.0 license. A separate commercial Enterprise Edition is available for organizations requiring advanced enterprise features and official vendor support.
873 open remote AI-training roles, updated November 15, 2026; most pay $20–$170 an hour. Zekai lists them free; the application goes to the employer’s platform.
Timefold Solver was forked from OptaPlanner on April 20, 2023, by the original creators to continue developing the planning engine.
The Community Edition in this repository is open-source under the Apache-2.0 license, while the Enterprise Edition is a commercial offering requiring a paid license.
Timefold Solver is built natively for Java and Kotlin applications running on JDK 21 or higher.
See Zekai first in Google