The most costly and labor-intensive activity for almost every warehouse is the order picking process and a key challenge for manufacturing companies is to store parts in an efficient way. Therefore, to minimize the order retrieval time when picking from a storage, the need of a sufficient storage categorization strategy becomes vital. One of the logistics centers at Scania in Södertälje stores parts that will be transported to the chassis assembly and the assembly of gearboxes and axles when needed in the production. In one of the storage areas at the logistics center, namely the PS storage, the forklift drivers picking from the storage have experienced congestion in the storage aisles and that it might be possible to reduce the order fulfillment time when picking the orders. This master thesis aims to investigate the possibility of optimizing the picking process in the PS storage, with respect to the order fulfillment time for the forklift drivers, with categorization of the goods. This has been analyzed with a heuristic optimization approach and with the use of a discrete event simulation model, where different categorization strategies have been applied on the storage and compared to the current state. By categorizing the goods in the PS storage, a reduction of the order fulfillment time can be done of around 4% - 5% compared to the current state with all tested categorization strategies. The strategy which has been shown to give the largest improvement is by categorizing the parts in the storage according to their final delivery address at the production line, which would reduce the order fulfillment time by 5.03% compared to the current state. With this categorization method, parts that are picked on the same route are located close to each other.

Dans cette thèse, nous étudions des algorithmes pour le monitoring des traces d’activité à grande échelle. Le monitoring est une aptitude clé dans plusieurs domaines, permettant d’extraire de la valeur des données ou d’améliorer les performances d’un système. Nous explorons d’abord le monitoring de données temporelles. Nous présentons un nouveau type de jointure sur des intervalles, qui inclut des fonctions de score caractérisant le degré de satisfaction de prédicats temporels. Nous étudions ces jointures dans le contexte du batch processing (traitement par lots). Nous formalisons la Ranked Temporal Join (RTJ), une jointure qui combine des collections d’intervalles et retourne les k meilleurs résultats. Nous montrons comment exploiter les propriétés des prédicats temporels et de la sémantique de score associée afin de concevoir TKIJ , une méthode d’évaluation de requête distribuée basée sur Map-Reduce. Nos expériences sur des données synthétiques et réelles montrent que TKIJ est plus performant que les techniques de l’état de l’art et démontre de bonnes performances sur des requêtes RTJ n-aires sur des données temporelles. Nous proposons également une étude préliminaire afin d’étendre nos travaux sur TKIJ au domaine du stream processing (traitement de flots). Nous explorons ensuite le monitoring dans le crowdsourcing (production participative). Nous soutenons la nécessité d’intégrer la motivation des travailleurs dans le processus d’affectation des tâches. Nous proposons d’étudier une approche adaptative, qui évalue la motivation des travailleurs lors de l’exécution des tâches et l’exploite afin d’améliorer l’affectation de tâches qui est réalisée de manière itérative. Nous explorons une première variante nommée Individual Task Assignment (Ita), dans laquelle les tâches sont affectées individuellement, un travailleur à la fois. Nous modélisons Ita et montrons que ce problème est NP-Difficile. Nous proposons trois méthodes d’affectation de tâches qui poursuivent différents objectifs. Nos expériences en ligne étudient l’impact de chaque méthode sur la performance globale dans l’exécution de tâches. Nous observons que différentes stratégies sont dominantes sur les différentes dimensions de performance. En particulier, la méthode affectant des tâches aléatoires et correspondant aux intérêts d’un travailleur donne le meilleur flux d’exécution de tâches. La méthode affectant des tâches correspondant au compromis d’un travailleur entre diversité et niveau de rémunération des tâches donne le meilleur niveau de qualité. Nos expériences confirment l’utilité d’une affectation de tâches adaptative et tenant compte de la motivation. Nous étudions une deuxième variante nommée Holistic Task Assignment (Hta), où les tâches sont affectées à tous les travailleurs disponibles, de manière holistique. Nous modélisons Hta et montrons que ce problème est NP-Difficile et MaxSNP-Difficile. Nous développons des algorithmes d’approximation pour Hta. Nous menons des expériences sur des données synthétiques pour évaluer l’efficacité de nos algorithmes. Nous conduisons également des expériences en ligne et comparons notre approche avec d’autres stratégies non adaptatives. Nous observons que notre approche présente le meilleur compromis sur les différentes dimensions de performance. / In this thesis, we study scalable algorithms for monitoring activity traces. In several domains, monitoring is a key ability to extract value from data and improve a system. This thesis aims to design algorithms for monitoring two kinds of activity traces. First, we investigate temporal data monitoring. We introduce a new kind of interval join, that features scoring functions reflecting the degree of satisfaction of temporal predicates. We study these joins in the context of batch processing: we formalize Ranked Temporal Join (RTJ), that combine collections of intervals and return the k best results. We show how to exploit the nature of temporal predicates and the properties of their associated scored semantics to design TKIJ , an efficient query evaluation approach on a distributed Map-Reduce architecture. Our extensive experiments on synthetic and real datasets show that TKIJ outperforms state-of-the-art competitors and provides very good performance for n-ary RTJ queries on temporal data. We also propose a preliminary study to extend our work on TKIJ to stream processing. Second, we investigate monitoring in crowdsourcing. We advocate the need to incorporate motivation in task assignment. We propose to study an adaptive approach, that captures workers’ motivation during task completion and use it to revise task assignment accordingly across iterations. We study two variants of motivation-aware task assignment: Individual Task Assignment (Ita) and Holistic Task Assignment (Hta). First, we investigate Ita, where we assign tasks to workers individually, one worker at a time. We model Ita and show it is NP-Hard. We design three task assignment strategies that exploit various objectives. Our live experiments study the impact of each strategy on overall performance. We find that different strategies prevail for different performance dimensions. In particular, the strategy that assigns random and relevant tasks offers the best task throughput and the strategy that assigns tasks that best match a worker’s compromise between task diversity and task payment has the best outcome quality. Our experiments confirm the need for adaptive motivation-aware task assignment. Then, we study Hta, where we assign tasks to all available workers, holistically. We model Hta and show it is both NP-Hard and MaxSNP-Hard. We develop efficient approximation algorithms with provable guarantees. We conduct offline experiments to verify the efficiency of our algorithms. We also conduct online experiments with real workers and compare our approach with various non-adaptive assignment strategies. We find that our approach offers the best compromise between performance dimensions thereby assessing the need for adaptability.

Submitted by Raniere Barreto (raniere.barros@ufvjm.edu.br) on 2018-08-17T18:26:35Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) jary_alves_santos.pdf: 1966576 bytes, checksum: db737a341539261dd88dd5436a57f2ac (MD5) / Approved for entry into archive by Rodrigo Martins Cruz (rodrigo.cruz@ufvjm.edu.br) on 2018-10-05T19:36:59Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) jary_alves_santos.pdf: 1966576 bytes, checksum: db737a341539261dd88dd5436a57f2ac (MD5) / Made available in DSpace on 2018-10-05T19:36:59Z (GMT). No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) jary_alves_santos.pdf: 1966576 bytes, checksum: db737a341539261dd88dd5436a57f2ac (MD5) Previous issue date: 2017 / A elabora??o de artigos ou trabalhos cient?ficos ? uma constante no cotidiano de um estudante de gradua??o. Uma das principais produ??es cient?ficas ? o Trabalho de Conclus?o de Curso (TCC), o qual em alguns casos, figura como requisito parcial ? obten??o do t?tulo de gradua??o. A viv?ncia no ambiente acad?mico mostra que, na ocasi?o de elabora??o de TCC, alguns erros podem ser cometidos e, nesse processo, h? v?rias nuances que devem ser observadas. O desenvolvimento de um sistema Web de acompanhamento, hist?rico e controle de fluxo da produ??o pode representar um excelente recurso de aux?lio na rela??o de cumplicidade que h? entre orientadores e orientandos. Esta disserta??o se prop?e a desenvolver um sistema Web para essa finalidade, denominado ?Academic DUX?. Este ? um Agente Inteligente de Software que realiza verifica??es pr?vias de trabalho, compara??o entre vers?es, coment?rios e acompanhamento dos mesmos atrav?s de uma linha de tempo. A automatiza??o do processo de acompanhamento dos trabalhos, utilizando-se metodologia relacionada ? Minera??o de Textos, proporciona o aprendizado atrav?s dos acertos e erros dos orientandos, bem como as principais orienta??es dos professores. / Disserta??o (Mestrado Profissional) ? Programa de P?s-Gradua??o em Tecnologia, Sa?de e Sociedade, Universidade Federal dos Vales do Jequitinhonha e Mucuri, 2017. / The elaboration of articles or scientific works is a constant in the daily life of a undergraduate student. One the main scientific productions the Course Competition Assignment (CCA) which, in some cases, is a partial requirement to obtain the degree. The experience in the academic environment shows that at the time of writing CCA some errors can be committed, and in this process there are several nuances that must be observed. The development of a Web monitoring, historical and production flow control system can be an excellent aid resource in the relationship of complicity between supervisors and undergraduates. This dissertation proposes to develop a Web system for this purpose, called "Academic DUX". This is a Intelligent Agents Software that performs pre-work checks, comparison of versions, comments, and tracking them through a timeline. The automation of the monitoring works process, using a methodology related to the Texting Mining, provides learning through the correct answers and errors of the undergraduate as well as the main teacher?s orientations.

abstract: The development of microsimulation approaches to urban systems modeling has occurred largely in three parallel streams of research, namely, land use, travel demand and traffic assignment. However, there are important dependencies and inter-relationships between the model systems which need to be accounted to accurately and comprehensively model the urban system. Location choices affect household activity-travel behavior, household activity-travel behavior affects network level of service (performance), and network level of service, in turn, affects land use and activity-travel behavior. The development of conceptual designs and operational frameworks that represent such complex inter-relationships in a consistent fashion across behavioral units, geographical entities, and temporal scales has proven to be a formidable challenge. In this research, an integrated microsimulation modeling framework called SimTRAVEL (Simulator of Transport, Routes, Activities, Vehicles, Emissions, and Land) that integrates the component model systems in a behaviorally consistent fashion, is presented. The model system is designed such that the activity-travel behavior model and the dynamic traffic assignment model are able to communicate with one another along continuous time with a view to simulate emergent activity-travel patterns in response to dynamically changing network conditions. The dissertation describes the operational framework, presents the modeling methodologies, and offers an extensive discussion on the advantages that such a framework may provide for analyzing the impacts of severe network disruptions on activity-travel choices. A prototype of the model system is developed and implemented for a portion of the Greater Phoenix metropolitan area in Arizona to demonstrate the capabilities of the model system. / Dissertation/Thesis / Ph.D. Civil and Environmental Engineering 2012

Spatial analysis for optimization of student assignments in cartography Abstract The aim of the diploma thesis is to perform a multi-criteria analysis of large spatial data, which will result in the identification of a predetermined number of the variants of the territory, which are optimal for creating the student assignments. The main part of the thesis is to design and to calculate the spatial evaluation criteria. In the theoretical part, a theory of multi-criteria analysis and examples of its use in general in geoinformatics and assessment of landscape potential are presented. The practical part is devoted to the design of own methodology for assessment of the territory from the point of view of suitability for processing of student tasks, including its application over the territory of the Czechia in order to obtain information about the territory. Multi-criteria analysis was divided into two steps: pre-selection of the territory based on Boolean evaluation and subsequent sorting of the variants from the most suitable to the least appropriate using the TOPSIS method. The scales of the individual criteria were determined by the scoring method. The main result of the thesis is a new set of the variants of the territory, which are comparable with their processing demands. Keywords Spatial analysis,...

xiii, 117 p. : ill. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number. / Students who struggle academically frequently lack or are unable to apply cognitive-motivational processes imperative for self-regulated learning. It is increasingly evident that deficits in self-regulation are a shared characteristic across students who qualify for special education. For example, impaired executive functions, or the cognitive processes responsible for managing and directing goal-directed activity, is a prevalent symptom domain across students with diverse special education identifications. Higher-order cognitive deficits become increasingly relevant as students progress to the secondary level as this transition necessitates the use of more complex organizational schemes to manage increased academic workload. Assignment management is a particularly challenging task for these students as poor organizational skills and lack of strategic approach translate to excessive time spent on assignments, lost materials, and negative attitude toward academic work. There is a growing body of research suggesting interventions targeting self-regulation have potential to improve performance on complex academic tasks such as assignment completion. Broadly speaking, these interventions are referred to as "self-management" strategies and are intended to help students actively reflect on their own cognitive and learning processes while engaged in academic tasks. The purpose of this study was to evaluate the impact of self-management strategy instruction on student "Assignment Attack" and related academic, behavioral, and cognitive variables. This study extended a line of inquiry examining implementation and efficacy of interventions targeting organized, independent student completion of assignments in resource contexts for adolescents who qualify for special education. Utilizing a multiple baseline, across participants research design, this study revealed positive effects of a Self-Regulated Assignment Attack Strategy (SAAS) on assignment attack and teacher-reported student behavior during assignment completion. The results indicated the effect was domain specific with minimal generalized improvement to the other academic, behavioral, or cognitive outcome measures. A discussion of the results is provided focused on the implications of improved assignment attack, generalization, and measurement challenges. Suggestions for further research in this area are provided. / Committee in charge: McKay Sohlberg, Chairperson, Special Education and Clinical Sciences; Robert Horner, Member, Special Education and Clinical Sciences; Richard Albin, Member, Special Education and Clinical Sciences; Bonnie Todis, Member, Not from U of 0; Thomas Dishion, Outside Member, Psychology

Much research has been undertaken to gain insight into business alignment of IT. This alignment basically aims to improve a firm’s performance by an improved harmonization of the business function and the IT function within a firm. The thesis discusses previous approaches and constructs an overall framework, which a potential approach needs to fit in. Being in a highly regulated industry, for airports there is little space left to increase revenues. However, the retailing business has proven to be an area that may contribute towards higher income for airport operators. Consequently, airport management should focus on supporting this business segment. Nevertheless, it needs to be taken into account that smooth airport operations are a precondition for successful retailing business at an airport. Applying the concept of information intensity, the processes of gate allocation and airport retailing have been determined to appraise the potential that may be realized upon (improved) synchronization of the two. It has been found that the lever is largest in the planning phase (i.e. prior to operations), and thus support by means of information technology (for information distribution and improved planning) may help to enable an improved overall retail performance. In order to determine potential variables, which might influence the output, a process decomposition has been conducted along with the development of an appropriate information model. The derived research model has been tested in different scenarios. For this purpose an adequate gate allocation algorithm has been developed and implemented in a purposewritten piece of software. To calibrate the model, actual data (several hundred thousand data items from Frankfurt Airport) from two flight plan seasons has been used. Key findings: The results show that under the conditions described it seems feasible to increase retail sales in the magnitude of 9% to 21%. The most influential factors (besides the constraining rule set and a retail area’s specific performance) proved to be a flight’s minimum and maximum time at a gate as well as its buffer time at gate. However, as some of the preconditions may not be accepted by airport management or national regulators, the results may be taken as an indication for cost incurred, in case the suggested approach is not considered. The transferability to other airport business models and limitations of the research approach are discussed at the end along with suggestions for future areas of research.

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-06-02T19:51:46Z (GMT). No. of bitstreams: 1 3393.pdf: 4478459 bytes, checksum: 69570a1820f1617b090f2e79453e5ec4 (MD5) Previous issue date: 2010-12-15 / Financiadora de Estudos e Projetos / The pursuit of excellence in customer service drives companies to investigate strategies that help to produce satisfactory solutions to the market, as is the case of beverage companies. One of the obstacles faced by this sector is the difficulty in distributing the demanded products within regular working hours due to long service times in each demand site. An alternative for reducing violations of route time consists in including the assignment of extra deliverymen to the usual routing and scheduling decisions. Such treatment is hardly often explored in the literature and it was not found any evidence of commercial softwares that consider it. In this sense, the current work addresses the Vehicle Routing Problem with the assignment of extra deliverymen, with the aim of generating routes in which the number of unserved clients in regular working hours is minimized. To this end, we propose an extension of Clarke and Wright heuristic. The proposed extension is applied to sets of examples generated based on classic instances of Solomon (1987) and Christofides et al. (1979). The results of the application are compared to those provided by the heuristic of Clarke and Wright according to a set of performance criteria. / A busca pela excelência no atendimento aos clientes faz com que empresas investiguem estratégias que auxiliem a obtenção de soluções satisfatórias no mercado, como é o caso das empresas do setor de bebidas. Um dos obstáculos enfrentados por este setor é a dificuldade em distribuir os produtos demandados dentro da jornada de trabalho estabelecida, em função dos altos tempos de serviço existentes em cada ponto de demanda. Uma alternativa para reduzir violações de tempo de rota consiste em incluir a designação de entregadores extras às decisões de roteamento e programação. Este tratamento é pouco explorado na literatura e não foi encontrada nenhuma evidência de softwares comerciais que o considerem. Neste sentido, o corrente trabalho aborda o Problema de Roteamento de Veículos com designação de entregadores extras, com o objetivo de gerar rotas em que o número de clientes não atendidos em uma dada jornada de trabalho seja minimizado. Para tal, é proposta uma extensão da heurística de Clarke e Wright. A extensão proposta é aplicada a conjuntos de exemplos gerados com base nas instâncias clássicas de Solomon (1987) e Christofides et al. (1979). Os resultados obtidos nestas aplicações são comparados aos fornecidos pela heurística de Clarke e Wright segundo um conjunto de critérios de desempenho.

Orientador: Orlando Lee / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-22T15:27:35Z (GMT). No. of bitstreams: 1 Curi_RafaelLima_M.pdf: 1469554 bytes, checksum: 8367cf52c9256338ee2963b9a9cdf41d (MD5) Previous issue date: 2013 / Resumo: Neste trabalho estudamos Jogos de Roteamento. Esta subclasse de jogos e uma das mais estudadas na literatura e permite modelar de forma relativamente simples vários cenários realistas. Por exemplo, tráfego de veículos em rodovias, transporte de mercadorias, redes de telefonia, redes de computadores como a Internet, etc. Analisamos as principais variantes de jogos de roteamento, destacando suas diferenças. Comparamos jogos atômicos versus jogos não-atômicos, jogos com fluxo divisível versus jogos com fluxo indivisível, jogos com demanda uniforme versus jogos com demanda genérica e jogos com redes específicas versus jogos com redes genéricas. Focamos nosso estudo na existência, unicidade e quantificação da ineficiência de equilíbrios que emergem do comportamento independente e egoísta dos jogadores. Estudamos o equilíbrio de Wardrop para jogos não-atômicos e o equilíbrio de Nash para jogos atômicos. Na literatura, notamos que a existência e unicidade de um equilíbrio dependem basicamente de três fatores: pressupostos nas funções que definem os custos dos segmentos de uma rota, tipo dos jogadores (atômicos ou não-atômicos, com demandas iguais ou diferentes) e topologia da rede. Apresentamos também os principais resultados de ineficiência obtidos para as métricas Preço da Anarquia (PoA) e Limite de Bicritério. Nos resultados que vimos, observamos que jogos não-atômicos possuem um PoA menor que o de jogos atômicos, jogos com fluxo divisível possuem um PoA menor que o de jogos com fluxo indivisível e jogos com demanda uniforme um PoA menor que o de jogos com demanda genérica / Abstract: In this work, we study Routing Games. This subclass of games is one of the most studied in the literature and allows us to model several realistic scenarios, in a relatively simple way. For instance, road traffic, freight transportation, telephone networks, computer networks like the Internet, etc. We analyze the main variants of routing games, emphasizing their differences. We compare atomic games versus nonatomic games, unsplittable flow games versus splittable flow games, unweighted games versus weighted games and specific network games versus generic network games. We focus our study on the existence, uniqueness and quantification of the inefficiency of equilibria that emerge from the independent and selfish behavior of the players. We study the Wardrop equilibrium for nonatomic games and the Nash equilibrium for atomic games. In the literature, we note that the existence and uniqueness of an equilibrium depends basically on three factors: assumptions on the functions that define the costs of the segments of a route, type of the players (atomic or nonatomic, with equal or different demands), and network topology. We present the main results of inefficiency obtained for the metrics Price of Anarchy (PoA) and Bicriteria Limit. In the results we have considered, we noticed that nonatomic games have lower PoA than the atomic ones, splittable flow games have lower PoA than the unsplittable flow ones, and unweighted games have lower PoA than the weighted ones / Mestrado / Ciência da Computação / Mestre em Ciência da Computação