Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Carlos Mencía"'
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
Publikováno v:
RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
RUO. Repositorio Institucional de la Universidad de Oviedo
Universidad de las Islas Baleares
Universidad de Oviedo (UNIOVI)
RUO. Repositorio Institucional de la Universidad de Oviedo
Universidad de las Islas Baleares
This paper studies the computation of ensembles of priority rules for the One Machine Scheduling Problem with variable capacity and total tardiness minimization. Concretely, we address the problem of building optimal ensembles of priority rules, star
Publikováno v:
Scopus
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
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
Publikováno v:
Integrated Computer-Aided Engineering. 26:49-63
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
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
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
https://hal.archives-ouvertes.fr/hal-03317619
Publikováno v:
Scopus
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
When solving a scheduling problem, users are often interested in finding a schedule optimizing a given objective function. However, in some settings there can be hard constraints that make the problem unfeasible. In this paper we focus on the task of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce52b90ad1d7c7990c7f2c7c5ec26042
http://hdl.handle.net/10651/57519
http://hdl.handle.net/10651/57519
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
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
http://hdl.handle.net/10651/57874
Publikováno v:
Swarm and Evolutionary Computation. 66:100944
Priority rules combined with schedule generation schemes are a usual approach to online scheduling. These rules are commonly designed by experts on the problem domain. However, some automatic method may be better as it could capture some characterist
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
Publikováno v:
Artificial Intelligence. 252:22-50
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical applications in recent years. However, many practical uses of SAT involve