haku: @indexterm Scheduling / yhteensä: 635
viite: 381 / 635
| Tekijä: | Abramson, D. |
| Otsikko: | Constructing school timetables using simulated annealing : sequential and parallel algorithms. |
| Lehti: | Management Science
1991 : JAN, VOL. 37:1, p. 98-113 |
| Asiasana: | TIMETABLING SCHEDULING ALGORITHMS |
| Kieli: | eng |
| Tiivistelmä: | A solution to the school timetabling problem is considered. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The timetabling problem is introduced, then the simulated annealing method is described. Annealing is then applied to the timetabling problem. A prototype timetabling environment is described followed by some experimental results. |
SCIMA