O presente trabalho aborda o problema de determinação de datas de entrega e o sequenciamento de tarefas com tempos de processamento estocásticos. O ambiente considerado constitui em uma máquina simples e tarefas com custos individuais e distintos de adiantamento e atraso de entrega (earliness e tardiness ou simplesmente E/T). O objetivo é determinar a sequência e as datas de entrega ótimas que simultaneamente minimizam o custo total esperado de E/T. Para a determinação de sequências candidatas, são apresentadas diversas heurísticas construtivas com tempo de execução polinomial baseadas em um método de inserção de tarefas. Considerando tarefas com distribuição normal, experimentos computacionais comprovam a eficácia dos algoritmos para problemas de menor porte, os quais fornecem soluções ótimas em 99,85% dos casos avaliados. Quando aplicadas a um conjunto com uma maior quantidade de tarefas, as heurísticas apresentaram resultados melhores do que o algoritmo disponível na literatura em mais de 80% dos casos. Consideradas tarefas com distribuição lognormal, obteve-se um percentual de otimalidade entre 93,87% e 96,45%, a depender da heurística aplicada. Demonstra-se ainda para o caso com distribuição normal que os métodos propostos são assintoticamente ótimos e, portanto, são indicados para a resolução de problemas de grande porte. / This work addresses the problem of concurrent due-date assignment and sequencing of a set of jobs on a stochastic single-machine environment with distinct job earliness and tardiness penalty costs. It is assumed that the jobs processing times are statistically independent and follow a normal distribution whose mean and variance are provided and they are not necessarily integer values. The objective is to determine the job sequence and the integer due dates which minimize the expected total earliness and tardiness costs. Several efficient insertion-based construction heuristics are proposed in order to find candidates for the optimal sequence with polynomial time complexity. For the normal distribution problem, numerical experiments show that the proposed heuristic methods are able to find the optimal solution in 99,85% when applied to problems with a smaller size. When applied to problems with a bigger size, the solutions found by the proposed heuristics had better costs than the solutions described in the literature in more than 80% of cases. For the lognormal distribution problem, the proposed heuristic methods provided solutions with a percentage of optimality between 93,87% and 96,45%. Furthermore, for the normal distribuition case, it was proven that the heuristics are asymptotically optimal, i.e., it can be used for problems of any size.

Made available in DSpace on 2016-04-26T20:30:32Z (GMT). No. of bitstreams: 1 Ines Maria dos Santos Coimbra de Almeida Prado.pdf: 696408 bytes, checksum: 5255dc304076ffb66e48265966019b79 (MD5) Previous issue date: 2010-06-08 / In order to successfully perform its increasingly complex duties, not only does the Public Administration require the power, but also a series of other elements, such as property, that may provide material support to its activities. Thus, public property is turned into a tool to help the Public Administration perform its duties, and therefore represent an important public resource and support for the achievement of public policies. It is crucial that public property be distributed in view to its adequate use and the legal institution that might be apt to carry out such use, as well as the choice for the best time to perform it in accordance to public interest. This work intends to focus on the public means to grant the use of public property to private entities, since such means are deemed more appropriate for that purpose than the ones contained in private law. Moreover, its structure is based in administrative law regulations, which should be more adequate for managing the use of public property by the State. The present study represents the analysis of the institutions that authorize, permit and grant the use of public property as legal categories, identifying at the same time some consensus in the applicable legal system with regard to public real estate. This effort was made towards organizing the entities that grant conveyance of use, whereas labels were less stressed (although not ignored) than the content of such grants / Para efetivação das diversas e cada vez mais complexas atividades que desempenha, a Administração necessita não só de poderes, mas também de um conjunto variado de coisas, como bens que se prestem como suporte material para a atividade administrativa. Os bens públicos surgem, assim, como instrumentos para a consecução dos deveres da Administração, representando importante riqueza pública e assento para a realização de políticas públicas. É necessário, portanto, dar destinação aos bens públicos elegendo o seu uso adequado, o instituto jurídico apto a viabilizá-lo, bem como a escolha do melhor momento para concretizá-lo, atendendo ao interesse público. No presente trabalho, pretende-se dar enfoque aos instrumentos estatais de outorga de uso privativo de bens públicos por entendê-los mais adequados que os instrumentos típicos do direito privado, justamente por ter sua formatação dada por normas de direito administrativo, mais apropriadas ao manejo das utilizações de bens públicos pelo Estado. O que se busca, no presente estudo, é a análise dos institutos da autorização de uso, permissão de uso e concessão de uso como categorias jurídicas, identificando alguma unidade no regime jurídico aplicável, tendo como objeto o patrimônio público imobiliário. O esforço foi no sentido de sistematizar os institutos de trespasse de uso, dedicando menor valor aos rótulos (embora não prescindindo deles) e conferindo mais destaque ao conteúdo das outorgas

Made available in DSpace on 2016-08-10T10:40:17Z (GMT). No. of bitstreams: 1 Geovane Reges de Jesus Campos.pdf: 308868 bytes, checksum: 7d7dde587ca6eede4281609bfad2c151 (MD5) Previous issue date: 2012-09-04 / This paper presents a study for the classroom assignment problem for the PUC Goiás, Area 3, Campus I, based on a programming system (SAPA), the Hungarian algorithm, and on the idea of solving the problem time by time. The problem is solved with real data no more than 6 seconds. / Este trabalho apresenta um estudo para o problema de designação de salas de aula para a PUC Goiás, área 3, Campus I, baseado em um sistema de programação (SAPA), no algoritmo Húngaro e na idéia de resolver o problema horário por horário. O problema é resolvido, com dados reais, em não mais do que 6 segundos.

Made available in DSpace on 2016-08-10T10:40:20Z (GMT). No. of bitstreams: 1 JEANCARLO RIBEIRO.pdf: 683766 bytes, checksum: 28e6690b67012436dd91788ec7ff346b (MD5) Previous issue date: 2013-06-17 / The classroom assignment problem at universities consist in distributing classes scheduled for the appropriate rooms, respecting the requirements in each situation. The objective of this work is to apply the Hungarian algorithm and a computational system to solve the classroom assignment problem time by time. The tests were performed with real data from the PUC Goiás for a quantitative of 5116 classes into 313 classrooms. As a result, we solved the problem in approximately 12 minutes and the solution quality was compared with manual designation usually applied by the institution, which takes a month and a half. / O problema de designação de salas de aula em Universidades consiste em distribuir turmas programadas para as devidas salas, respeitando os requisitos estabelecidos em cada situação. O objetivo deste trabalho é a aplicação do algoritmo húngaro e de um sistema computacional para a resolução do problema de alocação horário por horário. Os testes foram realizados com dados reais da PUC Goiás para um quantitativo de 5116 turmas em 313 salas de aula. Como resultados, resolvemos o problema em aproximadamente 12 minutos e comparamos a qualidade da solução com a designação manual usualmente realizada pela Instituição, a qual leva um mês e meio.

Made available in DSpace on 2016-08-10T10:40:24Z (GMT). No. of bitstreams: 1 Davi Taveira Alencar Alarcao.pdf: 944757 bytes, checksum: 30d55936bd0acaff3d7ecf1816fe22f5 (MD5) Previous issue date: 2015-02-07 / The classroom assignment problem at universities consist in distributing classes scheduled for the appropriate rooms, respecting the requirements in each situation. The objective of this work is to improve the process of allocation of classroom PUC Goiás. The tests were performed with real data from the PUC Goiás for a quantitative of 5116 classes into 312 classrooms. As a result, we solved the problem in approximately 34 minutes and the solution quality was compared both with manual designation usually applied by the institution, which takes a month and a half, as with the results found in Ribeiro (2012). / O problema de designação de salas de aula em Universidades consiste em distribuir turmas programadas para as devidas salas, respeitando os requisitos estabelecidos em cada situação. O objetivo deste trabalho é o de melhorar o processo de alocação de salas de aula da PUC Goiás. Os testes foram realizados com dados reais da PUC Goiás para um quantitativo de 5116 turmas em 312 salas de aula. Como resultados, resolvemos o problema em aproximadamente 34 minutos e comparamos a qualidade da solução tanto com a designação manual usualmente realizada pela Instituição, a qual leva um mês e meio, quanto com os resultados encontrados em Ribeiro (2012).

Quality control (QC) plan is an important component of manufacturing planning for mass customization. QC planning is to determine the operational tolerances and the way to control process variation for assuring the production quality against design tolerances. It includes four phases, i.e., tolerance stack-up analysis, tolerance assignment, in-process inspection design, and the procedure of error source diagnosis & process control. Previous work has been done for tolerance stack-up modeling based on the datum-machining surface relationship graph (DMG), machining error analysis, and worst-case/statistical method. In this research, the tolerance stack-up analysis is expanded with a Monte-Carlo simulation for solving the tolerance stack-up problem within multi-setups. Based on the tolerance stack-up model and process capability analysis, a tolerance assignment method is developed to determine the operation tolerance specifications in each setup. Optimal result is achieved by using tolerance grade representation and generic algorithm. Then based on a process variation analysis, a platform is established to identify the necessity of in-process inspection and design/select the inspection methods in quality control planning. Finally a general procedure is developed to diagnose the error sources and control the process variation based on the measurements.

This diploma thesis deals with legislative changes in tax revenues of municipalities since 2001. The changes in the shared taxes and property taxes are considered. The aim is to evaluate the legislative changes related to tax revenues of municipalities and to evaluate their impact on tax revenues of the three selected small municipalities. The theoretical part of the thesis covers the legislative changes that have occurred in the law on the tax assignment and law on the tax of real estate over the last ten years, and amendment to law on the tax assignment with the expected effect from 1 January 2013. The practical part consists of an analysis of tax revenue of three selected small municipalities and their development in response to legislative changes. The last part of the thesis summarizes the most important findings. In this thesis, I came to the conclusion that in every of the three analyzed municipalities the revenues from shared taxes and from property taxes increased over the period of interest.

Les problèmes d’optimisation discrète sont pour beaucoup difficiles à résoudre, depar leur nature combinatoire. Citons par exemple les problèmes de programmationlinéaire en nombres entiers. Une approche couramment employée pour les résoudreexactement est l’approche de Séparation et Évaluation Progressive. Une approchedifférente appelée « Resolution Search » a été proposée par Chvátal en 1997 pourrésoudre exactement des problèmes d’optimisation à variables 0-1, mais elle restemal connue et n’a été que peu appliquée depuis.Cette thèse tente de remédier à cela, avec un succès partiel. Une première contributionconsiste en la généralisation de Resolution Search à tout problème d’optimisationdiscrète, tout en introduisant de nouveaux concepts et définitions. Ensuite,afin de confirmer l’intérêt de cette approche, nous avons essayé de l’appliquer enpratique pour résoudre efficacement des problèmes bien connus. Bien que notrerecherche n’ait pas abouti sur ce point, elle nous a amené à de nouvelles méthodespour résoudre exactement les problèmes d’affectation généralisée et de localisationsimple. Après avoir présenté ces méthodes, la thèse conclut avec un bilan et desperspectives sur l’application pratique de Resolution Search. / The combinatorial nature of discrete optimization problems often makes them difficultto solve. Consider for instance integer linear programming problems, which arecommonly solved using a Branch-and-Bound approach. An alternative approach,Resolution Search, was proposed by Chvátal in 1997 for solving 0-1 optimizationproblems, but remains little known to this day and as such has seen few practicalapplications.This thesis attempts to remedy this state of affairs, with partial success. Itsfirst contribution consists in the generalization of Resolution Search to any discreteoptimization problem, while introducing new definitions and concepts. Next, wetried to validate this approach by attempting to solve well-known problems efficientlywith it. Although our research did not succeed in this respect, it lead usto new methods for solving the generalized assignment and uncapacitated facilitylocation problems. After presenting these methods, this thesis concludes with asummary of our attempts at practical application of Resolution Search, along withfurther perspectives on this matter.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2017-01-06T16:59:11Z No. of bitstreams: 2 Tese - Walid Abdala Rfaei Jradi - 2016.pdf: 5339936 bytes, checksum: 0a0a6bdc4791ee31c229b5175ae3af03 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-01-09T09:29:25Z (GMT) No. of bitstreams: 2 Tese - Walid Abdala Rfaei Jradi - 2016.pdf: 5339936 bytes, checksum: 0a0a6bdc4791ee31c229b5175ae3af03 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-01-09T09:29:25Z (GMT). No. of bitstreams: 2 Tese - Walid Abdala Rfaei Jradi - 2016.pdf: 5339936 bytes, checksum: 0a0a6bdc4791ee31c229b5175ae3af03 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-11-30 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The present work studies and proposes GPU-based parallel algorithms and implementations for the problem of macroscopic assignment of urban traffic on large-scale networks, promoting an in-depth investigation on each sub-problem that must be efficiently solved during the traffic assignment process. Among the main contributions of this work, there are: 1) the first GPU-based algorithm for the enumeration of chordless cycles; 2) a new parallel GPU-based shortest path algorithm that takes advantage of some common properties of urban traffic networks; a refinement in the parallel reduction implementation proposed by one of the leaders in the GPU market, which resulted in a 2.8x speedup relative to its original version; and finally, 3) a parallel algorithm for the macroscopic traffic assignment problem, 39x faster than the equivalent sequential approach when applied to large scale networks. The main goal of this thesis is to contribute to the extension of the PET-Gyn software, proposing efficient GPU data structures and parallel algorithms for a faster resolution of two well known problems in the literature: The Traffic Assignment Problem (TAP) and the Enumeration of Chordless Cycles. When applied to difficult input sets, the performed experiments showed a clear advantage of the parallel algorithms over their sequential versions. / O presente trabalho estuda e propõe algoritmos e implementações paralelas baseadas em GPU para o problema de alocação macroscópica de tráfego urbano em redes de grande porte, promovendo uma investigação aprofundada de cada sub-problema que deve ser resolvido de forma eficiente durante o processo de atribuição de tráfego. Entre as principais contribuições deste trabalho, estão: 1) o primeiro algoritmo baseado em GPU para a enumeração de ciclos sem corda; 2) um novo algoritmo de caminho mínimo paralelo que tira vantagem de algumas propriedades comuns das redes de tráfego urbano; Um refinamento na implementação de redução paralela proposta por um dos líderes no mercado de GPU, o que resultou em uma aceleração de 2,8x em relação à sua versão original; 3) e, finalmente, um algoritmo paralelo para o problema de alocação macroscópica de tráfego, 39x mais rápido do que a abordagem equivalente sequencial quando aplicado a redes de larga escala. O objetivo principal desta tese é de contribuir para a expansão do software PET-Gyn, propondo estruturas de dados de GPU eficientes e algoritmos paralelos para uma resolução mais rápida de dois problemas bem conhecidos na literatura: O Problema de Alocação de Tráfego e a Enumeração de Ciclos sem Corda. Quando aplicados a conjuntos de entrada difíceis, os experimentos realizados mostraram uma clara vantagem dos algoritmos paralelos sobre suas versões sequenciais.

Understanding migratory connectivity is essential for assessing the drivers behind population dynamics and for implementing effective management in migratory species. Genetic markers provide a means to describe migratory connectivity, as well as incorporate population genetic analyses, however genetic markers can be uninformative for species with weak genetic structure. In this study, we evaluate range-wide population genetic structure and migratory connectivity in the prothonotary warbler, Protonotaria citrea, a wetland-dependent neotropical migratory songbird, using high-resolution genetic markers. We reveal regional genetic structure between sampling sites in the Mississippi River Valley and the Atlantic Seaboard with overall weak genetic differentiation among populations (FST = 0.0051). By ranking loci by FST and using subsets of the most differentiated genetic markers (200 – 3000), we identify a maximum assignment accuracy (89.7% to site, 94.3% to region) using 600 single nucleotide polymorphisms. We assign samples from unknown origin nonbreeding sites to a breeding region, illustrating weak migratory connectivity between prothonotary warbler breeding and nonbreeding grounds. Our results highlight the importance of using high-resolution markers in studies of migratory connectivity with species exhibiting weak genetic structure. Using similar techniques, studies may begin to describe population genetic structure that was previously undocumented, allowing us to infer the migratory patterns of an increasing number of species.