21,569 research outputs found
Improving local search heuristics for some scheduling problems - I
Local search techniques like simulated annealing and tabu search are based on a neighborhood structure defined on a set of feasible solutions of a discrete optimization problem. For the scheduling problems and we replace a simple neighborhood by a neighborhood on the set of all locally optimal solutions. This allows local search on the set of solutions that are locally optimal
Non-linear great deluge with learning mechanism for solving the course timetabling problem
International audienc
- …