Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Rosa Medina Durán"'
Publikováno v:
Ingeniare: Revista Chilena de Ingeniería, Vol 19, Iss 1, Pp 53-61 (2011)
En este estudio se propone e implementa computacionalmente un algoritmo genético secuencial para resolver el problema del Job Shop Flexible (existente en la Gestión de Operaciones), el cual es parte de la familia de los problemas de programación d
Externí odkaz:
https://doaj.org/article/5e369e64de4e403db35a150845e08a5c
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5f7d2c270326387618049a0d9b33627
https://doi.org/10.2139/ssrn.4063502
https://doi.org/10.2139/ssrn.4063502
Autor:
Enrico Malaguti, Rosa Medina Durán
Assignment problems are about the best way of matching the elements of a first set with the elements of a second set. In Semi-Assignment problems, more than one element of the first set can be assigned to each element of the second. In many situation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6361629028c9c3b2140dfab5a337badd
http://hdl.handle.net/11585/713750
http://hdl.handle.net/11585/713750
Publikováno v:
Omega. 47:99-115
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arising in the wooden board cutting industry. A set of rectangular items has to be cut from rectangular stock boards, available in multiple formats. In addi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fcb4bf0191832f0ab4140c13abda848
https://doi.org/10.1016/j.omega.2013.08.007
https://doi.org/10.1016/j.omega.2013.08.007
Publikováno v:
IEEE Latin America Transactions. 14:2333-2338
The high capital expenditures in surgery units fosters to hospital to look for methods to optimize the use of their resources. This article presents a GRASP algorithm to determine a good schedule for elective surgeries considering the context of a Ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e445fa86359543087305b5ae222a6633
https://doi.org/10.1109/tla.2016.7530430
https://doi.org/10.1109/tla.2016.7530430
Publikováno v:
2017 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON).
This paper tackles the problem of finding the list of solutions with strictly increasing cost for the Semi-Assignment Problem. Four different algorithms are described and compared. The first two algorithms are based on a mathematical model and on a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74fe844aaf2951ad027ac0f438c1ce90
https://doi.org/10.1109/chilecon.2017.8229531
https://doi.org/10.1109/chilecon.2017.8229531
Several relevant optimization problems can be formulated as generalizations of Capacitated Covering Problems, by considering a cost function that combines a linear term with a nonlinear one. In this paper we introduce the Staircase Capacitated Coveri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae5f97b5b72ef9c353a0c33d8395ce10
http://hdl.handle.net/11585/562894
http://hdl.handle.net/11585/562894
We consider a two-dimensional cutting stock problem where stock of different sizes is available, and a set of rectangular items has to be obtained through two-staged guillotine cuts. We propose a heuristic algorithm, based on column generation, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::685c0d91050cca5e89ccd29968d0594b
http://hdl.handle.net/11573/1571746
http://hdl.handle.net/11573/1571746
Publikováno v:
Ingeniare. Revista chilena de ingeniería v.19 n.1 2011
SciELO Chile
CONICYT Chile
instacron:CONICYT
SciELO Chile
CONICYT Chile
instacron:CONICYT
espanolEn este estudio se propone e implementa computacionalmente un algoritmo genetico secuencial para resolver el problema del Job Shop Flexible (existente en la Gestion de Operaciones), el cual es parte de la familia de los problemas de programaci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::987c27d2d341e3f797e00830bfc73f3f
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052011000100006
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052011000100006