A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
From MaRDI portal
Publication:1046051
DOI10.1016/J.EJOR.2009.09.014zbMath1177.90192OpenAlexW2027488395MaRDI QIDQ1046051
Defu Zhang, Stephen C. H. Leung, Rym M'Hallah, Yong-Kai Liu
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.09.014
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ Operational research in education ⋮ Developing compact course timetables with optimized student flows ⋮ A column generation approach for solving the examination-timetabling problem ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A matheuristic for solving inventory sharing problems ⋮ A heuristic method to schedule training programs for small and medium enterprises ⋮ A comparative study of modern heuristics on the school timetabling problem ⋮ An assignment problem and its application in education domain: a review and potential path ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of search methodologies and automated system development for examination timetabling
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- A computational study of local search algorithms for Italian high-school timetabling
- Applying evolutionary computation to the school timetabling problem: The Greek case
- Hybrid variable neighbourhood approaches to university exam timetabling
- A simulated annealing code for general integer linear programs
- Applied simulated annealing
- A robust simulated annealing based examination timetabling system.
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- An integer programming formulation for a case study in university timetabling.
- Constraint programming approach for school timetabling.
- Recent research directions in automated timetabling
- Complexity of some special types of timetabling problems
- Design and implementation of a course scheduling system using Tabu Search
- Hybrid heuristics for examination timetabling problem
- A generalized class-teacher model for some timetabling problems
- Efficient solutions for a university timetabling problem through integer programming
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- Mathematical programming models and algorithms for a class--faculty assignment problem
- Programmed Search in a Timetabling Problem over Finite Domains
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- Student centred school timetabling
- A column generation approach for the timetabling problem of Greek high schools
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- Timetabling for Greek high schools
- A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
- A general meta-heuristic based solver for combinatorial optimisation problems
This page was built for publication: A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
