Timetabling Construction Problem (TCP)
Abstract: It will be described
the TCP in general and proposed polinomial algorithms to solve TCP in general
and different classsizes in TCP. A timetabling is a tabling of conducting
lessons by teachers arranged according to the room-time when they take place
that must meet a number of requirements and the timing of teaching processes
must quarantee that no student and no teacher has more than one lesson at the
same time. Let k, m, n be the number of lessons, teachers and rooms respectively, the
general TCP, as well as 2-classsizes TCP, can be solved in O(k m n)
Penulis: Sarngadi Palgunadi
Kode Jurnal: jptinformatikadd120276
