[PDF][PDF] Investigation of simulated annealing components to solve the university course timetabling problem
Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used
to solve complex optimization problems. This is due to its ease of implementation and …
to solve complex optimization problems. This is due to its ease of implementation and …
[PDF][PDF] Hybrid simulated annealing with meta-heuristic methods to solve uct problem
Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used
to solve complex optimization problems. This work proposes a hybrid SA with EMC to divert …
to solve complex optimization problems. This work proposes a hybrid SA with EMC to divert …
Workforce scheduling algorithms at Grolsch Brewery Enschede
MJ Veen - 2015 - essay.utwente.nl
In this thesis, a work force scheduling problem at Grolsch Brewery is examined. A number of
tasks must be scheduled over a period of days with a certain number of analysts available to …
tasks must be scheduled over a period of days with a certain number of analysts available to …