Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Palacios Alonso, Juan José"'
Autor:
Díaz Rodríguez, Hernán, Palacios Alonso, Juan José, Díaz Rodríguez, Susana Irene, Rodríguez Vela, María del Camino, González Rodríguez, Inés
Publikováno v:
WOS:000757834500001
This paper addresses a variant of the job shop scheduling problem with total tardiness minimization where task durations and due dates are uncertain. This uncertainty is modelled with intervals. Different ranking methods for intervals are considered
Autor:
Palacios Alonso, Juan José
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
Tesis con mención internacional
Scheduling problems are a kind of combinatorial problems that pose a great challenge to Artificial Intelligence researchers, being very hard to solve. They are well-known NP-complete problems which have had a gre
Scheduling problems are a kind of combinatorial problems that pose a great challenge to Artificial Intelligence researchers, being very hard to solve. They are well-known NP-complete problems which have had a gre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e7375754d9b4c151afa23b0d937a190f
http://hdl.handle.net/10651/33755
http://hdl.handle.net/10651/33755
Autor:
Palacios Alonso, Juan José, Rodríguez Vela, María del Camino, González Rodríguez, Inés, Puente Peinador, Jorge
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
META 2014, 5th International Conference on Metaheuristics and Nature Inspired Computing, in Marrakech, Morocco, October 27 - 31, 2014
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3546e8b3202ee72e1ab098810d4a05d1
http://meta2014.sciencesconf.org/37981
http://meta2014.sciencesconf.org/37981
Autor:
Palacios Alonso, Juan José, Rodríguez Vela, María del Camino, Puente Peinador, Jorge, González Rodríguez, Inés
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
In this paper we consider a variant of the flexible job shop scheduling problem with uncertain task durations modelled as fuzzy numbers. We propose a cooperative coevolutionary algorithm to minimise the schedule’s makespan, with two different popul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::54087ff28d276ef5fafd995631099852
http://hdl.handle.net/10651/31980
http://hdl.handle.net/10651/31980
Autor:
Palacios Alonso, Juan José
Publikováno v:
RUO. Repositorio Institucional de la Universidad de Oviedo
instname
instname
Scheduling problems have formed an important body of research during the last decades. A scheduling problem consists in scheduling a set of jobs {J1, . . . , Jn} on a set of physical resources or machines {M1, . . . , Mm}. Each job Ji is composed of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1311e24075231f4f368c666248e7a2d6
http://bioinspired.dacya.ucm.es/maeb2013/images/ActasCAEPIA_final.pdf
http://bioinspired.dacya.ucm.es/maeb2013/images/ActasCAEPIA_final.pdf