Every interviewer, room and rule, solved into one working schedule.
Calgebra is a scheduling optimization engine. You give it your people, rooms, hours and rules, and it returns the schedule that honors all of them, with every compromise shown, in seconds instead of an afternoon of calendar work.
Zero hard conflicts. Three panels moved, each inside the interviewer’s stated availability.
Six hard conflicts. Dana is double-booked at 8:00 and 9:00, and Leo at 1:00 and 2:00.
When time, people, rooms, and other resources collide, someone fixes it by hand, every day.
A single operating week can hold six hard conflicts, and coordinators reconcile them one at a time, which is a poor use of good people. The hours are real, they recur daily, and they almost never appear in a budget line where anyone can see them. Those hours could be better spent with the candidates, keeping them engaged throughout the process.
A “workable” schedule is not a solved schedule.
Take a moment with the video on the right to see what settling for a schedule that technically works really costs, and what changes when Calgebra solves for every rule at once.
How the engine thinks
Every scheduling problem Calgebra solves is written the way a mathematician would write it, which is also the way your best coordinator already thinks about it.
The rules come in two kinds. Hard constraints are the musts: rules the schedule can never break, and if no schedule satisfies them, the engine says so instead of guessing. Soft constraints are the preferences, such as a VP on the final panel when one is available, which the engine satisfies whenever it can and reports when it cannot.
panels_per_interviewer_per_day ≤ 4 interviewers_per_panel ≥ 3 room_capacity ≥ panel_size + 1
vp_on_final_panel if vp_available candidate_wait_between_rounds_min ≤ 15 prioritize_vetted_internal_candidates
Your interviewers, candidates, rooms and shifts, along with everyone’s availability.
The rules you enforce today and the ones you wish you could: availability, time zones, panel composition, a daily cap on interviews per person, and travel time between rooms.
The schedule that satisfies every hard rule and does the best possible job on the soft ones, with each compromise listed so a coordinator can accept or override it.
Results come back as a schedule you can read, with names, rooms and times.
When a rule has to bend, you see which one and why before anything goes out.
The constraints come from how your operation runs, modeled with you first.
Built for any operation that runs on shared time.
High-volume recruiting
Hundreds of candidates a week and panels of three to six, scheduled in one pass, with interviewer load spread fairly across the team and nobody booked twice.
More on recruitingMulti-participant meetings
Meetings that cross organizations and time zones, placed where every required attendee is actually free, with the priorities you set deciding between competing slots.
More on meetingsConference resource optimization
Speakers, rooms, staff and attendees fitted into one program, and solved again when a speaker cancels or a session outgrows its room.
More on conferencesCustom solutions
For any other operation that runs on shared time, we model the rules your industry and workflow impose and solve them with the same engine.
More on custom workSend us your worst scheduling scenario.
We will send it back solved, with every compromise listed.