Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
From MaRDI portal
Publication:342395
DOI10.1016/j.cor.2016.02.012zbMath1349.90308WikidataQ59140344 ScholiaQ59140344MaRDI QIDQ342395
Tiago Cardal Pais, Paula Amaral
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.02.012
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new lower bound for curriculum-based course timetabling
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- Tabu search for large scale timetabling problems
- A survey of search methodologies and automated system development for examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
- Application of a real-world university-course timetabling model solved by integer programming
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Structure identification of fuzzy model
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- The concept of a linguistic variable and its application to approximate reasoning. I
- Variable neighborhood search
- Metaheuristics for high school timetabling
- Planning of high school examinations in Denmark
- A robust simulated annealing based examination timetabling system.
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- A new model for automated examination timetabling
- Future paths for integer programming and links to artificial intelligence
- Generalized mixture operators using weighting functions: A comparative study with WA and OWA
- Variants of simulated annealing for the examination timetabling problem
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- New integer linear programming approaches for course timetabling
- Weighted aggregation operators based on minimization
- Note—A Preference Ranking Organisation Method
- New methods to color the vertices of a graph
- Ants can colour graphs
- Ant colony optimization for the examination scheduling problem
- Answer set programming as a modeling language for course timetabling
- A system for computing university examination timetables
- Final examination scheduling
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
