Made available in DSpace on 2016-06-02T19:50:25Z (GMT). No. of bitstreams: 1 6422.pdf: 2110662 bytes, checksum: eb693b2b653ba32626459f3fd72fa98b (MD5) Previous issue date: 2014-12-05 / The PBC System is a well-known Ordering System that periodically syncronizes the material flow of the shop floor. The PBC has the property of constant and planned production lead-time, a policy of minimal lot sizing and a constant frequency on order releasing. An exhaustive literature review presented in this thesis has shown that work uses PBC when the production capacity is not constant. This is a reality presented in companies where compensatory times off allows the capacity be tranfer between time stamps and employees that can work on diferente positions, allowing the capacity to be managed from one working center to another. This work formally defines those issues using mathematical programming, and defines a set of heuristics to solve it. After the application of the models and heuristics to a set of instances, one can note that the heuristics are eficiente to solve the problem, and the strategy of using PBC is very successful in the studied environment (production system with variable capacity). / O sistema PBC é conhecido como um sistema de controle da produção que sincroniza periodicamente o fluxo de materiais no chão de fábrica. O PBC tem a característica de possuir lead-time de produção constante e planejado, política de dimensionamento de lote conforme o mínimo necessário e frequência estável na liberação de ordens. Uma revisão exaustiva da literatura, apresentada neste trabalho, mostrou que não existem relatos do uso do PBC em ambientes onde a capacidade produtiva não é constante, uma realidade que se apresenta às empresas com a adoção de políticas de banco de horas (que permitem a transferência de capacidade produtiva entre diferentes períodos) e funcionários polivantes (que permitem a transferência de capacidade produtiva entre diferentes centros de trabalho). O presente trabalho define formalmente esse problema, usando técnicas de programação matemática, e propõe um conjunto de heurísticas para resolvê-lo. Após a aplicação dos modelos e heurísticas em um conjunto de casos de teste, mostra-se que as heurísticas propostas são eficazes para a resolução do problema, sendo estratégias viáveis para a implementação do PBC em ambientes de manufatura com capacidade variável.

Made available in DSpace on 2016-06-02T19:53:31Z (GMT). No. of bitstreams: 1 LUGO_Pedro_2013.pdf: 2147400 bytes, checksum: a0c7948826b7f243c447b99fd96c3388 (MD5) Previous issue date: 2013-09-12 / Financiadora de Estudos e Projetos / This research studies the hybrid flowshop scheduling problem. In this production configuration, we have a set of jobs that has to be processed in a set of stages. At every stage we have a set of parallel machines available to process the jobs. All jobs have to be processed following the same production flow, from the first to the last stage. Every job has to be processed on one machine at each stage and each machine can process at most one job at a time. Some constraints commonly found in real production systems as unrelated parallel machines, limited buffers, sequence-dependent setup times (both anticipatory and non-anticipatory), machine eligibility, transportation times and release times for machines are also taken into account. The optimization criterion is the makespan, whose minimization is related to the efficient use of production resources. A mixed integer programming model is proposed and solved by the commercial solver CPLEX. The computational evaluation results indicate that the model is suitable just to solve instances up to nine jobs and five stages. Therefore, to solve larger instances (50-100 jobs), several heuristics and an iterated local search (ILS) algorithm are proposed and evaluated computationally. The results indicate that the ILS is able to obtain good quality solutions in short computation times. / Este trabalho estuda o problema de programação da produção em sistemas Flowshop híbrido. Nesta configuração de produção há um conjunto de tarefas que deve ser processado em um conjunto de estações, nas quais um determinado número de máquinas paralelas encontra-se disponível para o processamento das tarefas. Todas as tarefas devem ser processadas seguindo o mesmo fluxo de produção, desde a primeira até a última estação. Cada tarefa deve ser processada em uma máquina de cada estação e cada máquina pode processar, no máximo, uma tarefa por vez. Algumas restrições comumente encontradas em sistemas de produção reais, como máquinas paralelas não relacionadas, buffers limitados, tempos de preparação dependentes da sequência (antecipatórios e não antecipatórios), elegibilidade de máquinas, tempos de transporte e tempos de liberação das máquinas, também são consideradas. O critério de otimização é o makespan, cuja minimização está diretamente relacionada com a utilização eficiente dos recursos de produção. Um modelo de programação inteira mista é proposto e resolvido através do solver comercial CPLEX. Os resultados da avaliação computacional indicam que o modelo é viável somente para resolver instâncias de até nove tarefas e cinco estações. Desta forma, para resolver instâncias de maior tamanho (50-100 tarefas), várias heurísticas e uma meta-heurística de busca local iterada (ILS, Iterated Local Search) são propostas e avaliadas computacionalmente. Os resultados indicam que o ILS é capaz de obter soluções de boa qualidade em curtos tempos computacionais.

Submitted by Fernando Souza (fernandoafsou@gmail.com) on 2017-08-15T11:46:12Z No. of bitstreams: 1 arquivototal.pdf: 884446 bytes, checksum: 92314027dddef8365b4a2e655b65bd78 (MD5) / Made available in DSpace on 2017-08-15T11:46:13Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 884446 bytes, checksum: 92314027dddef8365b4a2e655b65bd78 (MD5) Previous issue date: 2016-05-20 / The Static Bike Rebalancing Problem (SBRP) is a recent problem motivated by the task of repositioning bikes among stations in a self-service bike-sharing systems. This problem can be seen as a variant of the one-commodity pickup and delivery vehicle routing problem, where multiple visits are allowed to be performed at each station, i.e., the demand of a station is allowed to be split. Moreover, a vehicle may temporarily drop its load at a station, leaving it in excess or, alternatively, collect more bikes (even all of them) from a station, thus leaving it in default. Both cases require further visits in order to meet the actual demands of such station. This work deals with a particular case of the SBRP, in which only a single vehicle is available and the objective is to nd a least-cost route that meets the demand of all stations and does not violate the minimum (zero) and maximum (vehicle capacity) load limits along the tour. Therefore, the number of bikes to be collected or delivered at each station should be appropriately determined in order to respect such constraints. This is a NP-Hard problem since it contains other NP-Hard problems as special cases, hence, using exact methods to solve it is intractable for larger instances. Several methods have been proposed by other authors, providing optimal values for small to medium sized instances, however, no work has consistently solved instances with more than 60 stations. The proposed algorithm to solve the problem is an iterated local search (ILS) based heuristic combined with a randomized variable neighborhood descent (RVND) as local search procedure. The algorithm was tested on 980 benchmark instances from the literature and the results obtained are quite competitive when compared to other existing methods. Moreover, the method was capable of nding most of the known optimal solutions and also of improving the results on a number of open instances. / O Problema do Rebalanceamento Est atico de Bicicletas (Static Bike Rebalancing Problem, SBRP) e um recente problema motivado pela tarefa de reposicionar bicicletas entre esta c~oes em um sistema self-service de compartilhamento de bicicletas. Este problema pode ser visto como uma variante do problema de roteamento de ve culos com coleta e entrega de um unico tipo de produto, onde realizar m ultiplas visitas a cada esta c~ao e permitido, isto e, a demanda da esta c~ao pode ser fracionada. Al em disso, um ve culo pode descarregar sua carga temporariamente em uma esta c~ao, deixando-a em excesso, ou, de maneira an aloga, coletar mais bicicletas (at e mesmo todas elas) de uma esta c~ao, deixando-a em falta. Em ambos os casos s~ao necess arias visitas adicionais para satisfazer as demandas reais de cada esta c~ao. Este trabalho lida com um caso particular do SBRP, em que apenas um ve culo est a dispon vel e o objetivo e encontrar uma rota de custo m nimo que satisfa ca as demandas de todas as esta c~oes e n~ao viole os limites de carga m nimo (zero) e m aximo (capacidade do ve culo) durante a rota. Portanto, o n umero de bicicletas a serem coletadas ou entregues em cada esta c~ao deve ser determinado apropriadamente a respeitar tais restri c~oes. Trata-se de um problema NP-Dif cil uma vez que cont em outros problemas NP-Dif cil como casos particulares, logo, o uso de m etodos exatos para resolv^e-lo e intrat avel para inst^ancias maiores. Diversos m etodos foram propostos por outros autores, fornecendo valores otimos para inst^ancias pequenas e m edias, no entanto, nenhum trabalho resolveu de maneira consistente inst^ancias com mais de 60 esta c~oes. O algoritmo proposto para resolver o problema e baseado na metaheur stica Iterated Local Search (ILS) combinada com o procedimento de busca local variable neighborhood descent com ordena c~ao aleat oria (randomized variable neighborhood descent, RVND). O algoritmo foi testado em 980 inst^ancias de refer^encia na literatura e os resultados obtidos s~ao bastante competitivos quando comparados com outros m etodos existentes. Al em disso, o m etodo foi capaz de encontrar a maioria das solu c~oes otimas conhecidas e tamb em melhorar os resultados de inst^ancias abertas.

Neste trabalho estudamos relações entre expoente de Lyapunov e continuidade absoluta da folheação central para difeomorfismos parcialmente hiperbólicos conservativos de \'T POT. 3\'. Sobre tal tema, provamos que tipicamente (\'C POT. 1\' aberto e \'C POT. 2\' denso) os difeomorfismos parcialmente hiperbólicos, conservativos de classe \'C POT. 2\' , do toro \'T POT. 3\', apresentam folheação central não absolutamente contínua. Desta maneira, respondemos positivamente uma pergunta proposta em [20]. Também neste trabalho, estudamos entropia topológica para Sistema Iterado de Funções. Neste contexto, damos uma nova demonstração para uma conjectura proposta em [14] e provada primeiramente em [15]. Apresentamos um método geométrico que nos permite calcular entropia para transformações de \'S POT. 1\', como em [15]. Além de disso o método apresentado se verifica para casos mais gerais, como por exemplo: transformações não comutativas / In this work we study relations between Lyapunov exponents, absolute continuity of center foliation for conservative partially hyperbolic diffeomorphisms of \'T POT. 3\'. About this theme, (on a \'C POT. 1\' open and \'C POT. 2\'dense set) of conservative partially hyperbolic \'C POT. 2\' diffeomorphisms of the 3-torus presents non absolutely continuous center foliation. So, we answer positively a question proposed in [20]. Also in this work, we study topological entropy for Iterated Functions Systems. In this setting, we give a proof for a conjecture proposed in [14] and firstly proved in [15]. We present a geometrical method that allows us to calcule the entropy for transformations of \'S POT. 1\', like in [15]. Furthermore this method holds for more general cases, for example: non commutative transformations

Esse trabalho é um estudo sobre circuitos resistivos que apresentam a característica da autossimilaridade em sua configuração. A construção desses circuitos é feita de uma maneira recursiva, de forma análoga a um fractal autossimilar. Os circuitos são analisados pelas suas resistências equivalentes, sendo obtida uma condição para convergência desse valor. Os conceitos auxiliares necessários ao tema desta dissertação abordam a representação de um circuito resistivo como um grafo, além de conceitos envolvendo fractais autossimilares. São propostas ao final de cada capítulo atividades interdisciplinares acessíveis a alunos de ensino médio, com conteúdos envolvendo resistência equivalente, sequências, conjuntos, e noções de área e perímetro. / This work is a study of resistive circuits which present a characteristic of self similarity in their configuration. The construction of these circuits is made in a self recursive way, analogously to a self similar fractal. The circuits are analyzed by their equivalent resistance, and a condition for convergence of this quantity is obtained. Auxiliary concepts that are necessary to this dissertation theme treat the resistive circuit as a graph, and concepts involving self similar fractals. It is proposed at the end of each chapter interdisciplinary activities that are accessible to high school students, with topics involving equivalent resistence, sequences, sets, and notions of area and perimeter.

We use an agent-based model to investigate the interdependent dynamics between individual agency and emergent socioeconomic structure, leading to institutional change in a generic way. Our model simulates the emergence and exit of institutional units, understood as generic governed social structures. We show how endogenized trust and exogenously given leader authority influences institutional change, i.e., diversity in institutional life-cycles. It turns out that these governed institutions (de)structure in cyclical patterns dependent on the overall evolution of trust in the artificial society, while at the same time, influencing this evolution by supporting social learning. Simulation results indicate three scenarios of institutional life-cycles. Institutions may, (1) build up very fast and freeze the artificial society in a stable but fearful pattern (ordered system); (2) exist only for a short time, leading to a very trusty society (highly fluctuating system); and (3) structure in cyclical patterns over time and support social learning due to cumulative causation of societal trust (complex system).

L’altruisme réciproque, le mécanisme le plus vraisemblable expliquant l’existence de la coopération entre individus non-apparentés, peut être modélisé par le Dilemme du Prisonnier. Ce jeu prédit que la coopération devrait évoluer lorsque les joueurs prévoient d’interagir ensemble à maintes reprises et adoptent des stratégies conditionnelles telles que «Tit-For-Tat» ou Pavlov. Bien que la coopération soit à la source de toutes sociétés humaines, celle-ci est rarement observée chez les animaux. Une explication plausible serait que ces derniers sont plus impulsifs que les humains. Plusieurs études ayant évalué les effets de l’impulsivité sur la coopération ont en effet trouvé un impact négatif du phénomène de « discounting » sur la réciprocité. Néanmoins, l’impulsivité n’est pas un concept unitaire et le rôle de l’impulsivité motrice, une autre facette de l’impulsivité, reste inexploré, alors qu’elle pourrait également restreindre la coopération en altérant la capacité des individus à ajuster de manière flexible leur comportement face aux décisions prises par leur partenaire. En effet, l’impulsivité motrice se définit comme étant l’incapacité à inhiber un comportement qui n’est plus approprié suite à un changement de situation et est donc contreproductif (Broos et al., 2012; MacLean et al., 2014). Pour résoudre cette hypothèse, nous avons mené une expérience avec des diamants mandarins (Taenyopigia guttata) que nous avons appariés en fonction de leur niveau d’impulsivité motrice, puis nous les avons fait jouer dans un Dilemme du Prisonnier Alterné. Tel qu’attendu, nous avons trouvé que la coopération mutuelle survenait plus fréquemment entre les partenaires autocontrôlés que les paires d’individus impulsifs, ce qui serait dû à une différence entre les stratégies employées par les deux types d’individus. Plus précisément, les individus autocontrôlés utilisaient une stratégie « Generous TFT », tel que prédit par la théorie, alors que les oiseaux impulsifs choisissaient de coopérer avec une probabilité fixe, laquelle était indépendante de la décision précédemment prise par le partenaire. Si l’incapacité des individus impulsifs à utiliser des stratégies réactionnelles est due à une capacité de la mémoire de travail réduite, nos résultats pourraient alors contribuer à expliquer les différences interspécifiques qui existent au niveau des comportements coopératifs. / Reciprocal altruism, the most probable mechanism for cooperation among unrelated individuals, can be modelled as a Prisoner’s Dilemma. This game predicts that cooperation should evolve whenever the players, who expect to interact repeatedly, adopt conditional strategies. Yet, experimental data suggest that reciprocity would be rare in animal societies, maybe because animals, compared to humans, are very impulsive. Several studies examining the effect of impulsiveness on cooperation have indeed found a negative impact of temporal discounting. On the other hand, the role of impulsive action, another facet of impulsiveness, remains unexplored, though it could also impede cooperation by affecting the capacity of individuals to flexibly adjust their behaviour to their partner’s decision. To address this hypothesis, we conducted an experiment with zebra finches (Taenyopigia guttata) that were paired assortatively with respect to their level of impulsive action and then played an Alternating Prisoner’s Dilemma. As anticipated, we found that mutual cooperation occurred more frequently between self-controlled partners than between impulsive ones, a difference that was caused by differences in the strategy used by both types of individuals. Specifically, self-controlled individuals used a Generous TFT strategy, as predicted by theory, whereas impulsive birds chose to cooperate with a fixed probability, which was independent of their partner’s previous decision. If the inability of impulsive individuals to use reactive strategies are due to their reduced working memory capacity, our findings might contribute to explaining interspecific differences in cooperative behaviour.

Philosophiae Doctor - PhD / In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs Γn that are embeddable into the strong product L1(Kn)⊠  K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, Γn also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of Γn and Hn and determine their parameters. / South Africa

Cauchy problems for elliptic partial differential equations arise in many important applications, such as, cardiography, nondestructive testing, heat transfer, sonic boom produced by a maneuvering aerofoil, etc. Elliptic Cauchy problems are typically ill-posed, i.e., there may not be a solution for some Cauchy data, and even if a solution exists uniquely, it may not depend continuously on the Cauchy data. The ill-posedness causes numerical instability and makes the classical numerical methods inappropriate to solve such problems. For Cauchy problems, the research on uniqueness, stability, and efficient numerical methods are of significant interest to mathematicians. The main focus of this thesis is to develop numerical techniques for elliptic Cauchy problems. Elliptic Cauchy problems can be approached as data completion problems, i.e., from over-specified Cauchy data on an accessible part of the boundary, one can try to recover missing data on the inaccessible part of the boundary. Then, the Cauchy problems can be solved by finding a so-lution to a well-posed boundary value problem for which the recovered data constitute a boundary condition on the inaccessible part of the boundary. In this thesis, we use natural linearization approach to transform the linear Cauchy problem into a problem of solving a linear operator equation. We consider this operator in a weaker image space H−1, which differs from the previous works where the image space of the operator is usually considered as L2 . The lower smoothness of the image space will make a problem a bit more ill-posed. But under such settings, we can prove the compactness of the considered operator. At the same time, it allows a relaxation of the assumption concerning noise. The numerical methods that can cope with these ill-posed operator equations are the so called regularization methods. One prominent example of such regularization methods is Tikhonov regularization which is frequently used in practice. Tikhonov regularization can be considered as a least-squares tracking of data with a regularization term. In this thesis we discuss a possibility to improve the reconstruction accuracy of the Tikhonov regularization method by using an iterative modification of Tikhonov regularization. With this iterated Tikhonov regularization the effect of the penalty term fades away as iterations go on. In the application of iterated Tikhonov regularization, we find that for severely ill-posed problems such as elliptic Cauchy problems, discretization has such a powerful influence on the accuracy of the regularized solution that only with some reasonable discretization level, desirable accuracy can be achieved. Thus, regularization by projection method which is commonly known as self-regularization is also considered in this thesis. With this method, the regularization is achieved only by discretization along with an appropriate choice of discretization level. For all regularization methods, the choice of an appropriate regularization parameter is a crucial issue. For this purpose, we propose the balancing principle which is a recently introduced powerful technique for the choice of the regularization parameter. While applying this principle, a balance between the components related to the convergence rate and stability in the accuracy estimates has to be made. The main advantage of the balancing principle is that it can work in an adaptive way to obtain an appropriate value of the regularization parameter, and it does not use any quantitative knowledge of convergence rate or stability. The accuracy provided by this adaptive strategy is worse only by a constant factor than one could achieve in the case of known stability and convergence rates. We apply the balancing principle in both iterated Tikhonov regularization and self-regularization methods to choose the proper regularization parameters. In the thesis, we also investigate numerical techniques based on iterative Tikhonov regular-ization for nonlinear elliptic Cauchy problems. We consider two types of problems. In the first kind, the nonlinear problem can be transformed to a linear problem while in the second kind, linearization of the nonlinear problem is not possible, and for this we propose a special iterative method which differs from methods such as Landweber iteration and Newton-type method which are usually based on the calculation of the Frech´et derivative or adjoint of the equation. Abundant examples are presented in the thesis, which illustrate the performance of the pro-posed regularization methods as well as the balancing principle. At the same time, these examples can be viewed as a support for the theoretical results achieved in this thesis. In the end of this thesis, we describe the sonic boom problem, where we first encountered the ill-posed nonlinear Cauchy problem. This is a very difficult problem and hence we took this problem to provide a motivation for the model problems. These model problems are discussed one by one in the thesis in the increasing order of difficulty, ending with the nonlinear problems in Chapter 5. The main results of the dissertation are communicated in the article [35].

No description available.