Source: Lecture Notes in Artificial Intelligence. Conference titles: International Conference on Artificial Intelligence and Soft Computing - ICAISC. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem. Lecture Notes in Artificial Intelligence. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-61401-0_43. Acesso em: 02 nov. 2024. , 2020APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). An improved local search genetic algorithm with multi-crossover for job shop scheduling problem. Lecture Notes in Artificial Intelligence. Cham: Springer. doi:10.1007/978-3-030-61401-0_43NLM
Viana MS, Morandin Junior O, Contreras RC. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem [Internet]. Lecture Notes in Artificial Intelligence. 2020 ; 12415 464-479.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-030-61401-0_43Vancouver
Viana MS, Morandin Junior O, Contreras RC. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem [Internet]. Lecture Notes in Artificial Intelligence. 2020 ; 12415 464-479.[citado 2024 nov. 02 ] Available from: https://doi.org/10.1007/978-3-030-61401-0_43