( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling.

, , , и . Nat. Comput., 21 (4): 553-563 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jafet Mencía González

Eneldo Loza Mencía

Carlos Briede

Carlos Rodríguez

Carlos Schleipen

 

Другие публикации лиц с тем же именем

Partially Informed Depth-First Search for the Job Shop Problem., , и . ICAPS, стр. 113-120. AAAI, (2010)Optimally Scheduling a Job-Shop with Operators and Total Flow Time Minimization., , и . CAEPIA, том 7023 из Lecture Notes in Computer Science, стр. 193-202. Springer, (2011)Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling., , , и . Nat. Comput., 21 (4): 553-563 (2022)Reasoning About Inconsistent Formulas., и . IJCAI, стр. 4899-4906. ijcai.org, (2020)Survey track.Genetic Algorithm for Job-Shop Scheduling with Operators., , , и . IWINAC (2), том 6687 из Lecture Notes in Computer Science, стр. 305-314. Springer, (2011)Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules., , , , и . AI Commun., 28 (2): 365-381 (2015)Learning ensembles of priority rules for online scheduling by hybrid evolutionary algorithms., , , и . Integr. Comput. Aided Eng., 28 (1): 65-80 (2021)Intensified iterative deepening A* with application to job shop scheduling., , и . J. Intell. Manuf., 25 (6): 1245-1255 (2014)On Computing the Union of MUSes., , , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 211-221. Springer, (2019)MCS Extraction with Sublinear Oracle Queries., , , и . SAT, том 9710 из Lecture Notes in Computer Science, стр. 342-360. Springer, (2016)