Pages that link to "Item:Q2480804"

The following pages link to A survey of metaheuristic-based techniques for university timetabling problems (Q2480804):

Displaying 50 items.

• Real-life curriculum-based timetabling with elective courses and course sections (Q284409) (← links)
• Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
• A decision support approach to automatic timetabling in higher education institutions (Q310350) (← links)
• Operational research in education (Q319179) (← links)
• Finding robust timetables for project presentations of student teams (Q320999) (← links)
• Developing compact course timetables with optimized student flows (Q322740) (← links)
• A new lower bound for curriculum-based course timetabling (Q336544) (← links)
• Towards objective measures of algorithm performance across instance space (Q336954) (← links)
• Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
• An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling (Q398923) (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
• Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances (Q454883) (← links)
• A direct barter model for course add/drop process (Q534346) (← links)
• A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems (Q835631) (← links)
• A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
• Generating class schedules within a complex modular environment with application to secondary schools (Q892836) (← links)
• Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
• Recent research directions in automated timetabling (Q1598761) (← links)
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) (← links)
• Random partial neighborhood search for the post-enrollment course timetabling problem (Q1652508) (← links)
• A cellular memetic algorithm for the examination timetabling problem (Q1652614) (← links)
• Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
• The late acceptance hill-climbing heuristic (Q1698884) (← links)
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
• Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• A harmony search algorithm for university course timetabling (Q1761885) (← links)
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling (Q1761901) (← links)
• Solving the post enrolment course timetabling problem by ant colony optimization (Q1761913) (← links)
• On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
• A new model for curriculum-based university course timetabling (Q2037886) (← links)
• The multiphase course timetabling problem (Q2116932) (← links)
• Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
• An overview of curriculum-based course timetabling (Q2355018) (← links)
• A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
• Adaptive tabu search for course timetabling (Q2379550) (← links)
• Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
• A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables (Q2664347) (← links)
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751) (← links)
• An Adaptive Flex-Deluge Approach to University Exam Timetabling (Q2960370) (← links)
• Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm (Q3534665) (← links)
• A Simulated Annealing Genetic Algorithm for Solving Timetable Problems (Q4982175) (← links)
• Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
• (Q5702322) (← links)
• Algorithmic Applications in Management (Q5710155) (← links)
• Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)