Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Erick Lara-Cárdenas"'
Autor:
Ivan Amaya, José Carlos Ortiz-Bayliss, Arturo Silva-Galvez, Erick Lara-Cárdenas, Hugo Terashima-Marín, Jorge M. Cruz-Duarte
Publikováno v:
SSCI
The Job-Shop Scheduling Problem represents a challenging field of study due to its NP-Hard nature. Its many industrial and practical, real-world applications skyrocket its importance. Particularly, hyper-heuristics have attracted the attention of res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52acb5ee4124f4ea3ffaef510a0901d9
https://doi.org/10.1109/ssci47803.2020.9308131
https://doi.org/10.1109/ssci47803.2020.9308131
Autor:
José Carlos Ortiz-Bayliss, Iván Amaya, Xavier Sánchez-Díaz, Erick Lara-Cárdenas, Jorge M. Cruz-Duarte
Publikováno v:
Advances in Soft Computing ISBN: 9783030608835
MICAI (1)
MICAI (1)
The Job-Shop Scheduling problem is a combinatorial optimization problem present in many real-world applications. It has been tackled with a colorful palette of techniques from different paradigms. Particularly, hyper-heuristics have attracted the att
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a2f55e38f0f23ee4444e8dd2a6271db
https://doi.org/10.1007/978-3-030-60884-2_21
https://doi.org/10.1007/978-3-030-60884-2_21
Autor:
Arturo Silva-Galvez, Iván Amaya, Erick Lara-Cárdenas, José Carlos Ortiz-Bayliss, Jorge M. Cruz-Duarte
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030490751
MCPR
MCPR
The bin packing problem is a widespread combinatorial problem. It aims at packing a set of items by using as few bins as possible. Among the many available solving methods, approximation ones such as heuristics have become popular due to their reduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45b2f5cee5c4ff015215c74f7e08c758
https://doi.org/10.1007/978-3-030-49076-8_30
https://doi.org/10.1007/978-3-030-49076-8_30
Publikováno v:
Advances in Soft Computing ISBN: 9783030337483
MICAI
MICAI
Job Shop Scheduling problems have become popular because of their many industrial and practical applications. Among the many solving strategies for this problem, selection hyper-heuristics have attracted attention due to their promising results in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6da2556e16a7f2d498dacf239043803f
https://doi.org/10.1007/978-3-030-33749-0_13
https://doi.org/10.1007/978-3-030-33749-0_13