Management and Optimal Distribution of Large Student Numbers

Sabina Jeschke (), Gerald Lach, Robert Luce, Olivier Pfeiffer and Erhard Zorn
Additional contact information
Sabina Jeschke: IMA/ZLW & IfU – RWTH Aachen University
Gerald Lach: MuLF, Berlin University of Technology
Robert Luce: MuLF, Berlin University of Technology
Olivier Pfeiffer: MuLF, Berlin University of Technology
Erhard Zorn: MuLF, Berlin University of Technology

A chapter in Automation, Communication and Cybernetics in Science and Engineering 2009/2010, 2011, pp 71-84 from Springer

Abstract: Abstract Timetabling problems appear at every university. The degree of difficulty increases with an increasing number of students and courses for which the scheduling shall be carried out. From the mathematical point of view this is a “hard” problem, since the runtime on a computer cannot be estimated by a simple law (i.e. by a polynomial law) in the number of parameters. These kinds of problems are called “NP hard”. There are different aspects of the timetabling problem at universities and all specified problems are important for room management at universities, for the realization of courses that can be studied according to curricula, and for the satisfaction of students and teachers. These problems are related to the optimization of room management and personnel costs (e.g. by a uniform distribution of students). Thus, the solution of these problems is related to the optimization of “real” costs, a more and more important economic factor at (German) universities. Since 2003 for the solution of the post enrollment based course timetabling problem at the Technische Universität Berlin we are using an algorithm that has been realized by members of our team.Moreover, administration of homework and exams needs to be done. Thus, the Moses (Mobile Services for Students)-Account is being developed and used since 2004. This web-based software allows students to enroll in tutorials, with a list of preferences for given dates. A special algorithm, providing a globally optimized solution, processes all registrations.

Keywords: University Timetabling; Academic Administration; Integer Programming; NP-completeness (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-16208-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9783642162084

DOI: 10.1007/978-3-642-16208-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().