iUrnik: Timetabling for Primary Educational Institutions in Slovenia

References

• Bäck T (1994) Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. Michalewicz Z, Schaffer JD, Schwefel HP, Fogel DB, Kitano H, eds. Proc. First IEEE Conf. Evolutionary Comput. (IEEE Press, Piscataway, NJ), 57–62.Crossref, Google Scholar
• Beligiannis GN, Moschopoulos CN, Kaperonis GP, Likothanassis SD (2008) Applying evolutionary computation to the school timetabling problem: The Greek case. Comput. Oper. Res. 35(4):1265–1280.Crossref, Google Scholar
• Bueche D, Schraudolph NN, Koumoutsakos P (2004) Accelerating evolutionary algorithms with Gaussian process fitness function models. IEEE Trans. Human Machine Systems 5(2):183–194.Google Scholar
• Cooper TB, Kingston JH (1996) The complexity of timetable construction problems. Burke EK, Ross P, eds. First Internat. Conf. Practice Theory Automated Timetabling (Springer-Verlag, London), 281–295.Crossref, Google Scholar
• Martin CH (2004) Ohio University’s College of Business uses integer programming to schedule classes. Interfaces 34(6):460–465.Link, Google Scholar
• Pillay N (2014) A survey of school timetabling research. Ann. Oper. Res. 218(1):261–293.Crossref, Google Scholar
• Sampson SE, Freeland JR, Weiss EN (1995) Class scheduling to maximize participant satisfaction. Interfaces 25(3):30–41.Link, Google Scholar