Schedule
your whole school with AI
No more manual scheduling. Tell it your constraints, let AI do the work — a perfect timetable with
zero conflicts in seconds
Step 01
Enter data
Add teachers, subjects, classrooms, and hours — or import from Excel in seconds
ครูสมศรี
คณิตศาสตร์ · 18 ชม.
ครูวิชัย
วิทยาศาสตร์ · 16 ชม.
ห้อง 101
ความจุ 40 คน
คณิต ม.1/1
3 ชม./สัปดาห์
Step 02
Set constraints
Define availability, teaching hours, requirements, special restrictions, or pin important periods
Step 03
AI schedules instantly
One button — AI analyzes all constraints and builds a perfect, conflict-free timetable
< 15 min
saved per term
1 click
full school timetable
100%
conflict-free
✨ Available with every package · Launch promo: 100 free tokens (enough to AI-schedule your whole school)
Real AI, Not Just If-Else Logic
Tarangson uses Memetic Algorithm — a world-class AI technique that won the International Timetabling Competition (ITC). Not rule-based logic that schedules sequentially and calls itself AI.
How is it different from other software?
Schedules sequentially — first come, first served. If there's a conflict, just shift it. Cannot see the big picture or optimize globally. More constraints = more failures.
Creates hundreds of timetables simultaneously, lets them compete and evolve to find the truly optimal solution — just like nature selects the strongest organisms.
Memetic Algorithm
Combines 2 world-class AI techniques into one
Explore globally
Genetic Algorithm (GA)
Simulates natural evolution. Creates hundreds of timetables, lets them compete. The best ones crossover to produce even better next-generation timetables.
Refine locally
Simulated Annealing + ILS
Award-winning technique from the International Timetabling Competition (ITC). Takes the best timetables and polishes them point by point until perfect.
4-Step Process
Validate Constraints
Checks all data is complete, no conflicting constraints, places pinned periods. Reports problems instantly with suggestions.
Initial Timetables
Schedules the hardest subjects first, picks the best slot for each. Creates 30 diverse initial timetables.
Evolution (GA)
30 timetables compete. The best ones crossover to create next generations. Repeats for hundreds of generations until the optimal structure emerges.
Polish (SA+ILS)
Takes the top 3 timetables and fine-tunes them — swapping periods, moving subjects, adjusting rooms — point by point until perfect.
Supported Constraints
Hard Constraints
Never violated
- Teacher, student, room — only 1 assignment per period
- Teachers assigned to their subjects, specialized rooms
- Pinned periods are never moved
- Every subject gets its full hours
- Teacher unavailability is respected
- Consecutive periods always stay together
Soft Constraints
Optimized as much as possible
- Schedule preferred teacher time slots
- Distribute workload evenly across days
- Minimize gaps between periods
- Hard subjects in morning slots
- Custom constraints you define
Why Genetic Algorithm?
World-Class Technique
Uses techniques that won the International Timetabling Competition (ITC) — not a homegrown algorithm.
Handles Complex Constraints
Manages both hard and soft constraints simultaneously with transparent scoring 0-100.
Fast at Any School Size
Small school: 30 sec / Medium: 1-2 min / Large 150+ teachers: 2-5 min