Pages that link to "Item:Q1598761"
From MaRDI portal
The following pages link to Recent research directions in automated timetabling (Q1598761):
Displayed 37 items.
- A direct barter model for course add/drop process (Q534346) (← links)
- A scatter search based hyper-heuristic for sequencing a mixed-model assembly line (Q604932) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- A multiobjective framework for heavily constrained examination timetabling problems (Q613763) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- University space planning and space-type profiles (Q707692) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- A heuristic approach to simultaneous course/student timetabling (Q856666) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- Case-based heuristic selection for timetabling problems (Q880536) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- A university-timetabling problem and its solution using Benders' partitioning---a case study (Q964875) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution (Q992647) (← links)
- A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem (Q1014945) (← links)
- Application of a real-world university-course timetabling model solved by integer programming (Q1018245) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
- Hybrid heuristics for examination timetabling problem (Q1774877) (← links)
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university (Q1777154) (← links)
- Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
- New integer linear programming approaches for course timetabling (Q2468480) (← links)
- A web-based workforce management system for Sainsburys supermarkets Ltd. (Q2468756) (← links)
- A survey of metaheuristic-based techniques for university timetabling problems (Q2480804) (← links)
- Scheduling the professional soccer leagues of Austria and Germany (Q2583771) (← links)
- A mixed-integer mathematical modeling approach to exam timetabling (Q2655746) (← links)
- AUTOMATED LECTURE TIMETABLING USING A MEMETIC ALGORITHM (Q3528865) (← links)
- Timetabling problems at the TU Eindhoven (Q5902305) (← links)