Pages that link to "Item:Q1598761"

The following pages link to Recent research directions in automated timetabling (Q1598761):

Displaying 50 items.

• Elective course student sectioning at Danish high schools (Q284401) (← links)
• Real-life curriculum-based timetabling with elective courses and course sections (Q284409) (← links)
• Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
• A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
• Operational research in education (Q319179) (← links)
• Developing compact course timetables with optimized student flows (Q322740) (← links)
• A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
• A new lower bound for curriculum-based course timetabling (Q336544) (← links)
• Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
• Cyclic transfers in school timetabling (Q421072) (← links)
• A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
• Computational models for timetabling problem (Q478951) (← links)
• 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)
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems (Q1734832) (← links)
• Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
• A harmony search algorithm for university course timetabling (Q1761885) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Flight gate scheduling with respect to a reference schedule (Q1761900) (← links)
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem (Q1761902) (← links)
• Curriculum based course timetabling: new solutions to Udine benchmark instances (Q1761906) (← links)
• Solving the post enrolment course timetabling problem by ant colony optimization (Q1761913) (← links)
• An XML format for benchmarks in high school timetabling (Q1761916) (← 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)