One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms

Autor: Raúl Mencía, Carlos Mencía

Publikováno v: Mathematics, Vol 9, Iss 23, p 3030 (2021)

This paper addresses the problem of scheduling a set of jobs on a machine with time-varying capacity, with the goal of minimizing the total tardiness objective function. This problem arose in the context scheduling the charging times of a fleet of el

Externí odkaz: https://doaj.org/article/3c8c203bc9cc4289b17ca0448684843d

Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling

Autor: María R. Sierra, Carlos Mencía, Francisco J. Gil-Gala, Ramiro Varela

Publikováno v: Scopus
RUO. Repositorio Institucional de la Universidad de Oviedo
instname

Combining metaheuristics is a common technique that may produce high quality solutions to complex problems. In this paper, we propose a combination of Genetic Programming (GP) and Genetic Algorithm (GA) to obtain ensembles of priority rules to solve

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6c372292275f96a9ede6e46a5484a2f
https://doi.org/10.1007/s11047-020-09793-4

Reasoning About Strong Inconsistency in ASP

Autor: Joao Marques-Silva, Carlos Mencía

Publikováno v: 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020)
23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), Jul 2020, Alghero, Italy. pp.332-342, ⟨10.1007/978-3-030-51825-7_24⟩
Theory and Applications of Satisfiability Testing – SAT 2020
Scopus
RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
Theory and Applications of Satisfiability Testing – SAT 2020 ISBN: 9783030518240
SAT
RUO. Repositorio Institucional de la Universidad de Oviedo
instname

International Conference (23rd. Alghero. 2020)
This research is supported by the Spanish Government under project TIN2016-79190-R, by the Principality of Asturias under grant IDI/2018/000176, and by AN-ITI, funded by the French program “Invest

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db301851f4d453572d18c58dde7b6e1b
https://hal.archives-ouvertes.fr/hal-03317619

Reasoning About Inconsistent Formulas

Autor: Carlos Mencía, Joao Marques-Silva

Publikováno v: RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
IJCAI
RUO. Repositorio Institucional de la Universidad de Oviedo
instname

The analysis of inconsistent formulas finds an ever-increasing range of applications, that include axiom pinpointing in description logics, fault localization in software, model-based diagnosis, optimization problems, but also explainability of machi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad0a99e6095f15cbf401197b0b6ecf4f
http://hdl.handle.net/10651/57874

Efficient repairs of infeasible job shop problems by evolutionary algorithms

Autor: Ramiro Varela, Raúl Mencía, Carlos Mencía

Publikováno v: Scopus

We address the task of repairing infeasibility in the context of infeasible job shop scheduling problems with a hard constraint on the maximum makespan allowed. For this purpose, we adopt a job-based view of repairs, that allows for dropping some of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::791918fd2d9acb4c54c23bf25dee960b
https://doi.org/10.1016/j.engappai.2021.104368