====== Trabalho final ======

{{pf20191.pdf|Definição do trabalho}}

===== Trabalhos escolhidos =====

^ Nome ^ Titulo ^ E ^
| Kennya   | [[https://doi.org/10.1016/j.ejor.2011.01.011|Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times]]  | o |
| Luísa    | [[https://www.aaai.org/Library/AAAI/2007/aaai07-160.php|Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning]]  | o |
| Gabriel M.L. | [[https://doi.org/10.1007/s11590-014-0788-9|A general variable neighborhood search variants for the travelling salesman problem with draft limits]]  | o |
| Candy    | [[https://doi.org/10.1016/j.cor.2011.12.006|Probabilistic GRASP-Tabu search algorithms for the UBQP problem]]  | |
| José     | [[https://doi.org/10.1016/j.neucom.2017.04.053|Hybrid Whale Optimization Algorithm with simulated annealing for feature selection]]  | o |
| Gabriel A.P.  | [[https://doi.org/10.1016/j.ejor.2015.05.038|An efficient local search heuristic with row weighting for the unicost set covering problem]]  | o |

===== Agenda =====

^ Data ^ Hora ^ Apresentação ^
| 01/07 |  13.30 |  Kennya  |
| 01/07 |  14.00 |  José  |
| 01/07 |  14.30 |  Candy  |
| 03/07 |  13.30 |  Gabriel Langeloh  |
| 03/07 |  14.00 |  Gabriel Ammes  |
| 03/07 |  14.30 |  Luísa  |