Mostrar el registro sencillo del documento
Analizar los criterios de necesidad o suficiencia de optimización en variable real y compleja para estudiar la posibilidad de generalizarlos a grupos topológicos
dc.rights.license | Atribución-NoComercial 4.0 Internacional |
dc.contributor.advisor | Riaño Rojas, Juan Carlos |
dc.contributor.advisor | Casanova Trujillo, Simeón |
dc.contributor.author | Calderón Cardona, Jhonatan |
dc.date.accessioned | 2020-09-02T17:18:26Z |
dc.date.available | 2020-09-02T17:18:26Z |
dc.date.issued | 2020 |
dc.identifier.uri | https://repositorio.unal.edu.co/handle/unal/78360 |
dc.description.abstract | Una de las aplicaciones más comunes del cálculo es la optimización a través de la búsqueda del diferencial nulo. Para tal fin en grupos topológicos se utilizó la noción de derivada de Caratheodory introducida por Ernesto Acosta para exponer que en los puntos extremos de una función C-diferenciable, la derivada evaluada en el punto se anula. Lo anterior significa que si f : G → R es una función C-diferenciable en un punto extremo a entonces φ(a)[a] = 0, con lo cual se expone un criterio de necesidad para los puntos extremos de funciones C-diferenciables (diferenciables en sentido Caratheodory). Este resultado en el cálculo tradicional es bastante útil para hallar puntos extremos y por tal motivo se intentó trasladar este método a los problemas Job Shop, pero se observó que en grupos topológicos no es lo suficientemente fuerte para localizar dichos puntos. En el caso particular del problema Job Shop, se plantea además un criterio suficiente para determinar el tiempo mínimo de ejecución a través de un modelo propuesto, el cuál es efectivo en más del 95 % de los casos. (Texto tomado de la fuente) |
dc.description.abstract | One of the most common applications of calculus is optimization through the search for the null differential. For this purpose, in topological groups, the notion of Caratheodory derivative introduced by Ernesto Acosta was used to show that at the endpoints of a C-differentiable function, the derivative evaluated at the point is canceled. The above means that if f : G → R is a C-differentiable function at an extreme point a then φ(a)[a] = 0, which exposes a criterion of necessity for the extreme points of C-differentiable functions (differentiable in Caratheodory sense). This result in the calcus is quite useful to find extreme points and for this reason, we tried to translate this method to Job Shop problems, but it was observed that in topological groups it is not strong enough to locate these points. In the particular case of the Job Shop problem, a sufficient criterion is also proposed to determine the minimum execution time through a proposed model, which is effective in more than 95% of the cases. |
dc.format.extent | 65 |
dc.format.mimetype | application/pdf |
dc.language.iso | spa |
dc.rights | Derechos reservados - Universidad Nacional de Colombia |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ |
dc.subject.ddc | 510 - Matemáticas |
dc.title | Analizar los criterios de necesidad o suficiencia de optimización en variable real y compleja para estudiar la posibilidad de generalizarlos a grupos topológicos |
dc.title.alternative | Analyzing the criteria of necessity or optimization sufficiency in real and complex variable to study the possibility of generalizing them to topological groups. |
dc.type | Otro |
dc.rights.spa | Acceso abierto |
dc.description.additional | Tesis de grado presentada como requisito parcial para optar al título de: Magíster en Matemática Aplicada. |
dc.type.driver | info:eu-repo/semantics/other |
dc.type.version | info:eu-repo/semantics/acceptedVersion |
dc.publisher.program | Manizales - Ciencias Exactas y Naturales - Maestría en Ciencias - Matemática Aplicada |
dc.description.degreelevel | Maestría |
dc.publisher.department | Departamento de Matemáticas y Estadística |
dc.publisher.branch | Universidad Nacional de Colombia - Sede Manizales |
dc.relation.references | Silvia Vrancken Marcela Hecklein Adriana Engler, Daniela Müller. El calculo diferencial. Universidad Nacional del Litoral, 2005. |
dc.relation.references | Christelle Guéret Narendra Jussien André Langevin Louis-Martin Rousseau Arnaud Malapert, Hadrien Cambazard. An optimal constraint programming approach to the open-shop problem. 2011. |
dc.relation.references | M. Aminnayeri M. Zandieh B. Naderi, S.M.T. Fatemi Ghomi. A contribution and new heuristics for open shop scheduling. Computers and Operations Research 37 (2010) 213–221, 2010. |
dc.relation.references | M. Aminnayeri M. Zandieh B. Naderi, S.M.T. Fatemi Ghomi. A study on open shop scheduling to minimise total tardiness. 2011. |
dc.relation.references | Orhan Engin Mehmet Emin Baysal-Ahmet Sarucan Batuhan Eren Engin, Mehmet Onur Sümbül. A memetic algorithm to solve the open shop scheduling problem. Institute of Electrical and Electronics Engineers Inc. 2015. |
dc.relation.references | Christian Blum. Beam-aco hybridizing ant colony optimization with beam search: An application to open shop scheduling. 2005. |
dc.relation.references | Constantin Caratheodory. THEORY OF FUNCTIONS OF A COMPLEX VARIABLE. CHELSEA PUBLISHING COMPANY, 1954. |
dc.relation.references | Bidhu B. Mohanty Chia-Shin Chung. Minimizing expected makespan in a two-machine stochastic open shop with poisson arrival. Journal of Mathematical Analysis and Applications Volume 133, Issue 2, 1 August 1988, Pages 498-508, 1988. |
dc.relation.references | Christian Prins Christelle Guéret. A new lower bound for the open-shop problem. Annals of Operations Research 92(1999)165–183, 1999. |
dc.relation.references | Christian Prins Christelle Guéret, Narendra Jussien. Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems. European 50 Bibliografía Journal of Operational Research Volume 127, Issue 2, 1 December 2000, Pages 344-354, 2000. |
dc.relation.references | Cesar Delgado G. Ernesto Acosta G. Frechet vs. carathéodory. The American Mathematical Monthly, (04):332–338, 1994. |
dc.relation.references | Ernesto Acosta G. Diferenciability in topological groups. Soochow Journal of Mathematics, (01):39–48, 1996. |
dc.relation.references | Simeón Casanova. Héctor Andrés Granada. Cálculo de derivadas en algunos grupos topológicos. Dyna, 2008. |
dc.relation.references | Gunnar Wulkenhaar Jatinder N. D. Gupta, Frank Werner. Two-machine open shop scheduling with secondary criteria. International Transactions in Operational Research 10 (2003) 267–294, 2003. |
dc.relation.references | Stephen Kuhn. The derivative á la carathéodory. The American Mathematical Monthly, (01):40–44, 1991. |
dc.relation.references | Ching-Fang Liaw. A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operational Research 124 (2000) 28–42, 2000. |
dc.relation.references | Adam Nadolski Marek Kubale. Chromatic scheduling in a cyclic open shop. European Journal of Operational Research 164 (2005) 585–591, 2005. |
dc.relation.references | William A Sarache y Jaime A Giraldo Omar D Castrillón. Application of an evolutionary algorithm to solve job shop-open shop problems. 2011. |
dc.relation.references | T.C. Edwin Cheng Natalia V. Shakhlevich Peter Brucker, Sigrid Knust. Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research 129, 81–106, 2004, 2004. |
dc.relation.references | J-L Bouquard T Lorigeon, J-C Billaut. A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Operations Research Letters Volume 30, Issue 4, August 2002, Pages 276-280, 2002. |
dc.relation.references | Wieslaw Kubiak Tamás Kis, Dominique de Werra. A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Operations Research Letters 38 (2010) 129–132, 2010. |
dc.relation.references | Sartaj Sahni Teofilo Gonzalez. Open shop scheduling to minimize finish time. Journal of the Assooatlon for Computing Machinery, Vol 23, No 4, October 1976, 1976. Bibliografía 51 |
dc.relation.references | Hiroaki Ishiil Teruo Masuda. Two machine open shop scheduling problem with bicriteria. Discrete Applied Mathematics 52 (1994) 253-259, 1992. |
dc.relation.references | K. Zaras W. Kubiak, C. Sriskandarajah. A note on the complexity of openshop scheduling problems. INFOR: Information Systems and Operational Research, 29:4, 284-294, 1991. |
dc.relation.references | Pierre Laroche Yacine Benziani, Imed Kacem. Genetic algorithm for open shop scheduling problem. Institute of Electrical and Electronics Engineers Inc., 2018. |
dc.rights.accessrights | info:eu-repo/semantics/openAccess |
dc.subject.proposal | Optimization |
dc.subject.proposal | Optimización |
dc.subject.proposal | Topological groups |
dc.subject.proposal | Grupos topológicos |
dc.subject.proposal | Caratheodory |
dc.subject.proposal | Caratheodory |
dc.subject.proposal | Job Shop |
dc.subject.proposal | Job Shop |
dc.type.coar | http://purl.org/coar/resource_type/c_1843 |
dc.type.coarversion | http://purl.org/coar/version/c_ab4af688f83e57aa |
dc.type.content | Text |
oaire.accessrights | http://purl.org/coar/access_right/c_abf2 |
Archivos en el documento
Este documento aparece en la(s) siguiente(s) colección(ones)
![Atribución-NoComercial 4.0 Internacional](/themes/Mirage2//images/creativecommons/cc-generic.png)