This paper describes the use of simulated annealing (SA) for solving the school timetabling problem and compares the performance of six different SA cooling schedules: the basic geometric cooling schedule, a scheme which uses two cooling rates, and four schemes which allow reheating as well as cooling. The first two of these reheating schemes are variants of the basic geometric cooling schedule. The third and fourth reheating schemes incorporate a method to compute the temperature that is used as the reheating point. Extensive computational results, which are performed and described, show that the fourth reheating scheme produces consistently better quality solutions in less time than the solutions produced by the other schemes
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The simulated annealing (SA) algorithm [14] [5] has been applied to every difficult optimization pro...
This paper describes the use of simulated annealing (SA) for solving the school timeta-bling problem...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
This paper considers a solution to the school timetabling problem. The timetabling problem involves ...
This paper considers a solution to the school timetabling problem. The timetabling problem involves ...
This work presents a modified simulated annealing applied to the process of solving a typical high s...
Issues related to the resolution of scheduling problems tend to be best faced with the approximation...
National Nature Science Foundation of China [60773126]; Province Nature Science Foundation of Fujian...
School timetabling is way of distributing resources such as teachers and classrooms over a fixed per...
School timetabling is way of distributing resources such as teachers and classrooms over a fixed per...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
Most schools have the problem that they need to organise the meetings between students and teachers ...
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The simulated annealing (SA) algorithm [14] [5] has been applied to every difficult optimization pro...
This paper describes the use of simulated annealing (SA) for solving the school timeta-bling problem...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
This paper considers a solution to the school timetabling problem. The timetabling problem involves ...
This paper considers a solution to the school timetabling problem. The timetabling problem involves ...
This work presents a modified simulated annealing applied to the process of solving a typical high s...
Issues related to the resolution of scheduling problems tend to be best faced with the approximation...
National Nature Science Foundation of China [60773126]; Province Nature Science Foundation of Fujian...
School timetabling is way of distributing resources such as teachers and classrooms over a fixed per...
School timetabling is way of distributing resources such as teachers and classrooms over a fixed per...
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at t...
Most schools have the problem that they need to organise the meetings between students and teachers ...
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicle...
The simulated annealing (SA) algorithm [14] [5] has been applied to every difficult optimization pro...