Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Varela Arias, José Ramiro"'
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
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
http://hdl.handle.net/10651/65238
Autor:
Gil Gala, Francisco Javier, Mencía Cascallana, Carlos, Sierra Sánchez, María Rita, Varela Arias, José Ramiro
Publikováno v:
RUO: Repositorio Institucional de la Universidad de Oviedo
Universidad de Oviedo (UNIOVI)
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
Universidad de Oviedo (UNIOVI)
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
European Conference on Artificial Intelligence (ECAI’2020) (24th. Santiago de Compostela. 2020)
This research has been supported by the Spanish Government underresearch project TIN2016-79190-R and by the Principality of As-turias under grant I
This research has been supported by the Spanish Government underresearch project TIN2016-79190-R and by the Principality of As-turias under grant I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::704b164320b4200853b6764153c5d0c4
http://hdl.handle.net/10651/57896
http://hdl.handle.net/10651/57896
Autor:
Gil Gala, Francisco Javier, Mencía Cascallana, Carlos, Sierra Sánchez, María Rita, Varela Arias, José Ramiro
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
Conferencia de la Asociación Española para la Inteligencia Artificial (CAEPIA 2018) (18th. 2018. Granada)
This research has been supported by the Spanish Government under research project TIN2016-79190 R.
This research has been supported by the Spanish Government under research project TIN2016-79190 R.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::06679308f6d357c3cb05202451134561
http://hdl.handle.net/10651/50946
http://hdl.handle.net/10651/50946
Autor:
Mencía Cascallana, Raúl, Sierra Sánchez, María Rita, Mencía Cascallana, Carlos, Varela Arias, José Ramiro
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
In real-life production environments it is often the case that the processing of a task on a given machine requires the assistance of a human operator specially skilled to process that task. In this paper, we tackle a scheduling problem involving ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9c5fc7cdb9a9c6c22a7fe6034e6b7e5f
http://hdl.handle.net/10651/34034
http://hdl.handle.net/10651/34034
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
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
http://hdl.handle.net/10651/31596
Autor:
Hernández Arauzo, Alejandro, Puente Peinador, Jorge, González, Miguel A., Varela Arias, José Ramiro, Sedano Franco, Javier
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
We confront the problem of scheduling the charge of electric vehicles, under limited electric power contract, with the objective of maximizing the users’ satisfaction. The problem is motivated by a real life situation where a set of users demand el
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5ed56af3cebec343d897a6ae61cc6ac1
http://icaps13.icaps-conference.org/wp-content/uploads/2013/05/spark13-proceedings.pdf
http://icaps13.icaps-conference.org/wp-content/uploads/2013/05/spark13-proceedings.pdf
Autor:
Mencía Cascallana, Carlos, Sierra Sánchez, María Rita, Salido, Miguel A., Escamilla, Joan, Varela Arias, José Ramiro
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
We propose an enhanced depth- rst heuristic search algorithm to face the job shop scheduling problem with operators. This problem extends the classical job shop scheduling problem by considering a limited number of human operators that assist the pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8cd4ff1f59d7039cda19406647789d24
http://hdl.handle.net/10651/34010
http://hdl.handle.net/10651/34010
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
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
http://hdl.handle.net/10651/31597
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
We propose a partially informed depth-first search algorithm to cope with the Job Shop Scheduling Problem with makespan minimization. The algorithm is built from the well-known P. Brucker's branch and bound algorithm. We improved the heuristic estima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::47e36681ecf538bc23e42e1d2796e7cc
http://hdl.handle.net/10651/34020
http://hdl.handle.net/10651/34020
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
We face the Job Shop Scheduling Problem by means of branch and bound and A ∗ search. Our main contribution is a new method, based on constraint propagation rules, that allows improving the heuristic estimations. We report results from an experiment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::31fa838d90e18142630ab10dc9bf9502
http://hdl.handle.net/10651/34022
http://hdl.handle.net/10651/34022