Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Francisco J. Gil-Gala"'
Publikováno v:
Information Sciences. 634:340-358
Publikováno v:
Integrated Computer-Aided Engineering. 30:275-292
Scheduling is a frequently studied combinatorial optimisation problem that often needs to be solved under dynamic conditions and to optimise multiple criteria. The most commonly used method for solving dynamic problems are dispatching rules (DRs), si
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:
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
Autor:
Francisco J. Gil-Gala, Ramiro Varela
Publikováno v:
From Bioinspired Systems and Biomedical Applications to Machine Learning ISBN: 9783030196509
IWINAC (2)
IWINAC (2)
On-line scheduling is often required in real life situations. This is the case of the one machine scheduling with variable capacity and tardiness minimization problem, denoted \((1,Cap(t)||\sum T_i)\). This problem arose from a charging station where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d552db0e1e729531f39dae20d672eaf3
https://doi.org/10.1007/978-3-030-19651-6_22
https://doi.org/10.1007/978-3-030-19651-6_22
Publikováno v:
Scopus
RUO. Repositorio Institucional de la Universidad de Oviedo
Scipedia SL
RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
RUO. Repositorio Institucional de la Universidad de Oviedo
Scipedia SL
RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
On-line scheduling is often required in a number of real-life settings. This is the case of distributing charging times for a large fleet of electric vehicles arriving stochastically to a charging station working under power constraints. In this pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3edf1a133e26b0b8f69444a37fe445fa
http://hdl.handle.net/10651/53756
http://hdl.handle.net/10651/53756