Modeling and Solution of a Complex University Course Timetabling Problem

Murray, Keith S.; Müller, Tomáš; Rudová, Hana

doi:10.1007/978-3-540-77345-0_13

Cited by 37 publications

(34 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specific to conference scheduling, Sampson et al [9] introduced formulations for maximizing the number of talks of interest attendees can attend. For the related problem of course scheduling, Murray et al [6] introduced formulations for minimizing student and instructor conflicts subject to scheduling constraints. While automated scheduling is appropriate when the parameters and constraints of the optimization problem are well-specified, our interviews with past CHI organizers suggest a need for mixed-initiative, interactive optimization [4,10] that engage organizers to tackle soft considerations and tacit constraints.…”

Section: Related Workmentioning

confidence: 99%

Cobi

Kim

Zhang

André

et al. 2013

Proceedings of the 26th Annual ACM Symposium on User Interface Software and Technology

View full text Add to dashboard Cite

Effectively planning a large multi-track conference requires an understanding of the preferences and constraints of organizers, authors, and attendees. Traditionally, the onus of scheduling the program falls on a few dedicated organizers. Resolving conflicts becomes difficult due to the size and complexity of the schedule and the lack of insight into community members' needs and desires. Cobi presents an alternative approach to conference scheduling that engages the entire community in the planning process. Cobi comprises (a) communitysourcing applications that collect preferences, constraints, and affinity data from community members, and (b) a visual scheduling interface that combines communitysourced data and constraint-solving to enable organizers to make informed improvements to the schedule. This paper describes Cobi's scheduling tool and reports on a live deployment for planning CHI 2013, where organizers considered input from 645 authors and resolved 168 scheduling conflicts. Results show the value of integrating community input with an intelligent user interface to solve complex planning tasks.

show abstract

Section: Related Workmentioning

confidence: 99%

Cobi

Kim

Zhang

André

et al. 2013

Proceedings of the 26th Annual ACM Symposium on User Interface Software and Technology

View full text Add to dashboard Cite

show abstract

“…Obviously, if the conflict graph is |P |-colourable, a proper colouring is found. Such a model is employed, for instance, at Purdue University (Rudová & Murray, 2003;Murray, Müller, & Rudová, 2007).…”

Section: An Application In Course Timetablingmentioning

confidence: 99%

A supernodal formulation of vertex colouring with applications in course timetabling

et al. 2010

Self Cite

View full text Add to dashboard Cite

For many problems in Scheduling and Timetabling the choice of an mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new formulation using "supernodes". In the definition of George and McIntyre [SIAM J. Numer. Anal. 15 (1978), no. 1, 90-112], "supernode" is a complete subgraph, where each two vertices have the same neighbourhood outside of the subgraph. Seen another way, the algorithm for obtaining the best possible partition of an arbitrary graph into supernodes, which we give and show to be polynomial-time, makes it possible to use any formulation of vertex multicolouring to encode vertex colouring. The power of this approach is shown on the benchmark problem of Udine Course Timetabling. Results from empirical tests on DIMACS colouring instances, in addition to instances from other timetabling applications, are also provided and discussed.

show abstract

“…Nevertheless, some authors claim that few papers applying models and methods using instances of real-world data (Carter & Laporte, 1998;McCollum, 2007;Murray et al, 2007) can be found. These authors note that many articles concentrate on developing solutions to simplified problems, or that they use artificial data sets, and rarely extend their solutions to large scale formulations.…”

Section: Introductionmentioning

confidence: 99%

Desenvolvimento de um modelo de programação linear para o Problema da Construção de Grades Horárias em Universidades

2017

View full text Add to dashboard Cite

Resumo: A construção de grades horárias dos cursos de uma universidade é um problema que deve ser enfrentado no início de todos os semestres e, por mobilizar quantidades significativas de recursos Abstract:Creating timetables for courses is a problem that universities face at the beginning of every semester. This activity represents an important administrative task because it consumes significant amount of resources. In terms of computational complexity, this is classified as NP-hard, as it demands a huge amount of processing capacity. Timetabling is modeled in a number of different ways, aiming to fit the country's educational context, meet specific rules of institutions of higher education or specific goals of managers, among others. In this paper, we propose a mathematical model to solve the University Course Timetabling Problem and optimize classroom utilization.To solve the proposed model, an algorithm that divides the problem was developed, solving it with mixed integer linear programming tools. Computational experiments applied to a real database of a Brazilian public university confirmed the good performance of the proposed approach, which greatly reduces the amount of assigned classrooms.

show abstract

Modeling and Solution of a Complex University Course Timetabling Problem

Cited by 37 publications

References 15 publications

Cobi

Cobi

A supernodal formulation of vertex colouring with applications in course timetabling

Desenvolvimento de um modelo de programação linear para o Problema da Construção de Grades Horárias em Universidades

Contact Info

Product

Resources

About