Zobrazeno 1 - 6 of 6 pro vyhledávání: '"González Fernández, Miguel Ángel"'
1
Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to maxcut problem: quantum circuit compilation by genetic algorithm for qaoa applied to maxcut problem
Autor: Arufe Rivas, Lis, González Fernández, Miguel Ángel, Oddi, A., Rasconi, R., Varela Arias, José Ramiro
Publikováno v: Scopus
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
This research has been supported by the Spanish Government under research projects TIN2016-79190-R and PID2019-106263RB-I00/AEI/10.13039/501100011033, and by the Principality of Asturias under grant FC-GRUPIN-IDI/2018/000176. A. Oddi and R. Rasconi w
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=RECOLECTA___::c5fcfcc6cebc0c38e0c5665c93b8d010
http://hdl.handle.net/10651/65238
Zobrazit plný text záznamu
2
An efficient memetic algorithm for the flexible job shop with setup times
Autor: González Fernández, Miguel Ángel, Rodríguez Vela, María del Camino, Varela Arias, José Ramiro
Publikováno v: RUO. Repositorio Institucional de la Universidad de Oviedo
instname
This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times (SDSTFJSP). This is an extension of the classical job shop scheduling problem with many applications in real production environments. We propose an effe
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5cee40bd863e1b8c7906046deab8d9fa
http://hdl.handle.net/10651/31596
Zobrazit plný text záznamu
4
Tabu search and genetic algorithm for scheduling with total flow time minimization
Autor: González Fernández, Miguel Ángel, Rodríguez Vela, María del Camino, Sierra Sánchez, María Rita, Varela Arias, José Ramiro
Publikováno v: RUO. Repositorio Institucional de la Universidad de Oviedo
instname
In this paper we confront the job shop scheduling problem with total flow time minimization. We start extending the disjunctive graph model used for makespan minimization to represent the version of the problem with total flow time minimization. Usin
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2807eeb3ab06a2f5b16f9b2602215cfd
http://hdl.handle.net/10651/31597
Zobrazit plný text záznamu
5
A new hybrid genetic algorithm for the job shop scheduling problem with setup times
Autor: González Fernández, Miguel Ángel, Rodríguez Vela, María del Camino, Varela Arias, José Ramiro
Publikováno v: RUO. Repositorio Institucional de la Universidad de Oviedo
instname
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous work and propose a new neighborhood structure for this problem which i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::dd23b1154f7762a17bf2dcab4672e8aa
http://hdl.handle.net/10651/31584
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje