Complexity of some special types of timetabling problems

Werra, Dominique de; Asratian, Armen S.; Durand, Sylvain

doi:10.1002/jos.97

Cited by 30 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…De Werra et al (2002) presented a simple model and some possible extensions for classteacher timetabling problems. The computational complexity of these problems was also studied, showing some variants of the problem as NP-complete.…”

Section: The Examination Timetabling Problem: Modellingmentioning

confidence: 99%

A new model for automated examination timetabling

et al. 2011

View full text Add to dashboard Cite

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable resource for research into examination timetabling, the instances have significant limitations in terms of their relevance to real-world examination timetabling in modern universities. This paper presents a detailed model which draws upon experiences of implementing examination timetabling systems in universities in Europe, Australasia and America. This model represents the problem that was presented in the 2nd International Timetabling Competition (ITC2007). In presenting this detailed new model, this paper describes the examination timetabling track introduced as part of the competition. In addition to the model, the datasets used in the competition are also based on current real-world instances introduced by EventMAP Limited. It is hoped that the interest generated as part of the competition will lead to the development, investigation and application of a host of novel and exciting techniques to address this important real-world search domain. Moreover, the motivating goal of this paper is to close the currently existing gap between theory and practice in examination timetabling by presenting the research community with a rigorous model which represents the complexity of the real-world situation. In this paper we describe the model and its motivations, followed by a full formal definition

show abstract

Section: The Examination Timetabling Problem: Modellingmentioning

confidence: 99%

A new model for automated examination timetabling

et al. 2011

View full text Add to dashboard Cite

show abstract

“…[30][31][32] Complexity issues in course timetabling have also been studied in some depth. 33,34 A wide variety of research papers on different types of timetabling are also available. [8][9][10][11][12] In this paper, we investigate CBR for course timetabling.…”

Section: Timetabling Problemsmentioning

confidence: 99%

Multiple-retrieval case-based reasoning for course timetabling problems

Burke

MacCarthy

Petrović

et al. 2006

Journal of the Operational Research Society

View full text Add to dashboard Cite

The structured representation of cases by attribute graphs in a case-based reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organized as a decision tree and the retrieval process chooses those cases that are sub-attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependent upon problem-specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialization method for local search methods such as hill climbing, tabu search and simulated annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialization method for these approaches.

show abstract

“…In this case, we cannot even find any feasible solution in two hours of computation time. Some- (24). With this strategy, P rob1 is solved to optimality in time very close to the limit of 2 hours.…”

Section: Namechrḡs Nodesmentioning

confidence: 99%

“…The class-teacher model is formulated as an edge-coloring problem on a bipartite multigraph [23]. It is polynomially solvable, but the addition of some real-life constraints makes the problem NP-complete [24].…”

Section: Introductionmentioning

confidence: 99%

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

Avella

Vasil'Ev

2005

J Sched

View full text Add to dashboard Cite

In this paper we describe a successful case-study where a Branch-and-Cut algorithm yields the "optimal" solution of a real-world timetabling problem for university courses (University Course Timetabling problem). The polyhedral structure of the problem is studied in conection with a polytope of the Set Packing problem. Several families of cutting planes are introduced, these being crutial to find an optimal solution for the problem presented.

show abstract

Complexity of some special types of timetabling problems

Cited by 30 publications

References 12 publications

A new model for automated examination timetabling

A new model for automated examination timetabling

Multiple-retrieval case-based reasoning for course timetabling problems

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

Contact Info

Product

Resources

About