Timetabling
Move one course, and every student, lecturer and room tied to it moves too. We plan the whole timetable at once.
- Free 30-minute call
- No commitment
- You own the code
In short: A university timetable fixes when and where every course takes place. It assigns lectures to rooms and time slots so that no student group or lecturer has two lectures at once. Every room is big enough, and there’s enough time to get from one campus to another.
The problem
In week three of planning the autumn semester, a department moves its statistics lecture to Tuesday at ten. Now forty students have a clash, and the lecturer is due in two rooms at the same time. The only free room seats half the class. You spend the afternoon on email.
The word “timetabling” makes the job sound like filling in a calendar. But one weekly timetable has to work for thousands of students, each taking a different mix of courses. It must place hundreds of courses, each needing a room and a lecturer. And it draws on dozens of rooms with different sizes and equipment.
Move one course, and you move every student in it. You move its lecturer, and every room it frees or blocks. Every change affects many others. That makes course timetabling a hard planning problem. Optimisation researchers have worked on it for decades.
Why room-booking tools fall short
Generic tools get equipment wrong when they model a room by its seats alone. A course that needs a lab ends up in a lecture hall, however big it is. If every department builds its own timetable, some students almost always end up with two courses at the same time. And a room-booking tool notices a clash only after both bookings are in the system.
Travel is the clash nobody sees on paper. A lecture at nine on the north campus and a seminar at ten on the south campus don’t overlap. Yet no student can make both in time. Students are the first to notice this problem, and a room-booking tool doesn’t see it at all.
What changes
Today, departments hand in their wishes and you untangle clashes by email, one at a time. Our model plans the whole timetable at once, for every student, lecturer and room. You see which preferences it kept and which it gave up. You adjust what you know better and publish a timetable that works.
University timetabling software, open source or custom work
You have three options: open source, our product or a custom model. We tell you honestly which one fits. Free, open-source timetabling systems exist. Some cover courses, exams and the assignment of students to course groups in one. If your rules fit what they model, and your IT team can install and run them, start there. They cost little, and you’ll learn quickly which of your rules they can’t handle.
ScheduleOptima is our product. It covers the same basic rules: clashes, rooms and travel time. It packages the conflict, room and travel-time logic as a system you run yourself each semester. You get an automated university timetable, and you stay in charge of it. When your rules go beyond any product, we build a custom model around them.
Course timetabling: what you get
We put your enrolments, rooms and equipment into the model. We add when each lecturer is available, the walking times between your sites and every preference on your list. We test the model on your hardest week before you publish anything. You judge the result on figures you already know, such as clashes, free periods between classes and preferences met. Course timetabling is the sibling of exam timetabling, and many institutions solve them together.
- A model written around your own timetabling rules.
- Results measured in the numbers you already track.
- It slots into how you already work, and you can check every answer it gives.
How it works
Every shift, job and resource goes into one model, and your rules go in as hard limits. You get the best schedule that keeps all of them. What “best” means is your call: lowest cost, the fairest split or the fewest late orders.
Course-to-room assignment
The most important question is which course goes into which room. Every course group needs a free room that is big enough for its students. It also needs the right equipment: a lab, a projector, a computer room. The model records what each room can do, as well as how many it seats. Capacity and equipment are hard constraints, rules it never trades away.
Lecturer availability
Each course needs its lecturer present and free of clashes. The model keeps the limits you agreed with the faculty: how many hours a lecturer teaches and when they have to be present. The model reads your room, lecturer and course lists directly. It assigns each section a room, a slot and a lecturer, and proves that every hard rule is kept.
Student group conflict avoidance
The hardest part is avoiding student conflicts. Two courses clash when enough students take both, so they can’t share a slot. The conflict graph is a map of these clashes. For every pair of courses, it shows how many students take both.
The model reads your enrolment data. Wherever two courses share students, it sets a hard constraint, for the whole institution at once. That’s how it avoids the impossible weeks that department plans leave behind. A popular course with 300 students needs a 300-seat room, and a practical needs the right lab. The model fits both.
Multi-campus travel time
Travel time turns a feasible timetable, one that keeps every rule, into a usable one. So the model treats travel time between campuses and buildings as a constraint. When a student has two classes in a row in different places, the model leaves enough time between them to get there.
You only see this problem when you look at all students together. A department planning alone can’t see which of its students cross campus at ten. The model sees every student’s week, so the gap is there before anyone has to run.
Soft constraints and preferences
Then come the soft constraints: wishes the model meets as long as they don’t conflict with a hard constraint. Lecturers prefer compact teaching days. Students prefer morning or afternoon blocks. Departments like their courses clustered, to free up time for research. Some rooms suit some teaching styles.
None of these wishes is a must, and they can’t all be met at once. The model meets every hard rule first. Then it meets as many wishes as it can, and you decide how much each one counts. The model never gives up a hard rule to meet a wish. It only weighs one wish against another. You see which preferences you kept and which you gave up.
Constraint programming and MILP
Constraint programming (CP) is the natural tool here. CP works directly with logical rules, such as “these two courses never share a slot”. Course timetabling is full of them. One kind of rule gives courses that clash different time slots. Others make sure no room and no lecturer is booked twice at the same time. The model drops dead ends during the search, long before a room-booking tool would notice a clash. You get a timetable without clashes.
Other goals are numbers you can add up, such as how full the rooms are, how evenly teaching is shared among lecturers or how far people walk. For those we use mixed-integer linear programming (MILP). It’s a maths model made of yes-or-no decisions and decisions about quantities. The strongest course scheduling algorithms often combine the two. CP finds a timetable that keeps every rule, and MILP optimises the numbers on top.
Common questions.
Something else? Ask us directly.
Yes. Free, open-source timetabling systems exist. Some cover courses, exams and the assignment of students to groups in one. They’re serious tools. The cost comes from setup, data and the staff time to run them. If your rules fit, that can be the right choice, and we’ll say so.
Enrolments or study plans, a room list with seats and equipment, lecturer availability and your rules. Most universities already hold all of this in their student system and room booking tool. Last year’s timetable helps too, because it shows what lecturers and students are used to. Missing room data or lecturer availability is normal, and we fill it in with you.
Yes, through preferences with weights you agree on. A department can ask to have its teaching on a few days or in a favourite room. The model meets such wishes as long as they don’t conflict with a fixed rule. It shows which wishes it met, which it didn’t and why. That turns the usual email haggling into a decision people can see.
Sometimes it can, and if that’s the case, we’ll tell you. Standard software is built for an average operation, though. Yours runs on its own rules: your contracts, your exceptions, the things you know by heart. A custom model writes those rules in, and that’s where the better plan comes from.
You don’t need either to start. We build the model from the data you’ve already got, even if it lives in three spreadsheets and one person’s head. You get a system you run yourself. We train your team until they no longer need us.
You see a first result with the prototype, before you commit to anything bigger. We start with a free 30-minute call about your operation and the model that would fit it. Then we build a working prototype and run it on your numbers.
Similar pages.
Terms on this page
Every abbreviation explained in plain words, in our article “Metrics and methods”.
Tell us what you’re planning.
In a free 30-minute call with a specialist, you find out whether optimisation can help.
- Free, no commitment
- You talk to a specialist directly
- A clear go or no-go