fet is open source free software for automatically scheduling the timetable of a school, highschool or university. it uses a fast and efficient timetabling algorithm. it is licensed under gnu gpl.
usually, fet is able to solve a complicated timetable in maximum 520 minutes. for simpler timetables, it may take a shorter time, under 5 minutes (in some cases, a matter of seconds). for extremely difficult timetables, it may take a longer time, a matter of hours.
features:
localized to en_us (us english, default), ar (arabic), ca (catalan), da (danish), de (german), el (greek), es (spanish), fa (persian), fr (french), he (hebrew), hu (hungarian), id (indonesian), it (italian), lt (lithuanian), mk (macedonian), ms (malay), nl (dutch), pl (polish), pt_br (brazilian portuguese), ro (romanian), ru (russian), si (sinhala), sk (slovak), sr (serbian), tr (turkish) and uk (ukrainian) (incompletely for some languages)
fully automatic generation algorithm, allowing also semiautomatic or manual allocation
platform independent implementation, allowing running on gnu/linux, windows, mac and any system that qt supports
powerful flexible modular xml format for the input file, allowing editing with an xml editor or by hand (besides fet interface)
import/export from csv format
the resulted timetables are exported into html, xml and csv formats
very flexible students (pupils) structure, organized into sets: years, groups and subgroups. fet allows overlapping years and groups and nonoverlapping subgroups. you can even define individual students (as separate sets)
each constraint has a weight percentage, from 0.0% to 100.0% (but some special constraints can have only 100% weight percentage possible)
limits for the algorithm (all these limits can be increased on demand, as a custom version, because this requires a bit more memory):
* maximum total number of hours (periods) per day: 60
* maximum number of working days per week: 35
* maximum total number of teachers: 6000
* maximum total number of sets of students: 30000
* maximum total number of subjects: 6000
* virtually unlimited number of activity tags
* maximum number of activities: 30000
* maximum number of rooms: 6000
* maximum number of buildings: 6000
adjustable duration for each activity (each activity can have duration of 1 hour, 2 hours, 3 hours or more)
possibility of adding multiple teachers and students sets for each activity. that is, each activity can have specified any number of students subgroups (sets) and any number of teachers (it is possible to have no teacher or no students set for an activity, also)
* maximum number of time constraints: 60000
* maximum number of space constraints: 60000
a large and flexible palette of time constraints:
* break periods
for teacher(s):
not available periods
max/min days per week
max gaps per day/week
max hours daily/continuously
min hours daily
max hours daily/continuously with an activity tag
respect working in an hourly interval a max number of days per week
for students (sets):
not available periods
begins early (specify max allowed beginnings at second hour)
max gaps per day/week
max hours daily/continuously
min hours daily
max hours daily/continuously with an activity tag
respect working in an hourly interval a max number of days per week
for an activity or a set of activities/subactivities:
a single preferred starting time
a set of preferred starting times
a set of preferred time slots
min/max days between them
end(s) students day
same starting time/day/hour
not overlapping
consecutive, ordered, grouped (for 2 or 3 (sub)activities)
min gaps between a set of (sub)activities
a large and flexible palette of space constraints:
room not available periods
for teacher(s):
home room(s)
max building changes per day/week
min gaps between building changes
for students (sets):
home room(s)
max building changes per day/week
min gaps between building changes
preferred room(s):
for a subject
for an activity tag
for a subject and an activity tag
individually for a (sub)activity
