scientific article; zbMATH DE number 1728534
From MaRDI portal
Publication:2779804
zbMATH Open0982.68784MaRDI QIDQ2779804FDOQ2779804
Authors: Luca Di Gaspero, Andrea Schaerf 
Publication date: 15 April 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2079/20790104
Title of this publication is not available (Why is that?)
Recommendations
- A tabu search algorithm to schedule university examinations
- A tabu search algorithm to solve a course timetabling problem
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- Exact and metaheuristic methods for a real-world examination timetabling problem
- scientific article; zbMATH DE number 1728533
- Adaptive tabu search for course timetabling
- Hybrid heuristics for examination timetabling problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)
Cited In (52)
- A tabu search algorithm to schedule university examinations
- Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions
- Title not available (Why is that?)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Practices in timetabling in higher education institutions: a systematic review
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Novel local-search-based approaches to university examination timetabling
- Improving paper spread in examination timetables using integer programming
- Extended clique initialisation in examination timetabling
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- A survey of search methodologies and automated system development for examination timetabling
- Case-based heuristic selection for timetabling problems
- Applying evolutionary computation to the school timetabling problem: The Greek case
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Hybrid variable neighbourhood approaches to university exam timetabling
- A step counting hill climbing algorithm applied to university examination timetabling
- Tackling the maximum happy vertices problem in large networks
- Real-life examination timetabling
- A robust simulated annealing based examination timetabling system.
- Recent research directions in automated timetabling
- Memetic techniques for examination timetabling
- A column generation approach for solving the examination-timetabling problem
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Monte Carlo hyper-heuristics for examination timetabling
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- Exact and metaheuristic methods for a real-world examination timetabling problem
- Title not available (Why is that?)
- Optimization of the integrated problem of employee timetabling and job shop scheduling
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- A tabu search algorithm for computing an operational timetable
- Solving the examination timetabling problem in GPUs
- Adaptive tabu search for course timetabling
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Using tabu search with longer-term memory and relaxation to create examination timetables.
- A multi-objective evolutionary algorithm for examination timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- Variants of simulated annealing for the examination timetabling problem
- A new model for automated examination timetabling
- An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
- Linear combinations of heuristics for examination timetabling
- Local search and constraint programming for a real-world examination timetabling problem
- Comparison of metaheuristic algorithms for examination timetabling problem
- An adaptive flex-deluge approach to university exam timetabling
- A cellular memetic algorithm for the examination timetabling problem
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Hybrid heuristics for examination timetabling problem
- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779804)
