451 |
Scheduling policies considering both production duration and energy consumption criteria for environmental management / Stratégie d'ordonnancement prenant en compte des critères de durée de production et de consommation d'énergie pour le management environnementalAl-Qaseer, Firas Abdulmajeed 15 November 2018 (has links)
Nous présentons les enjeux du management environnemental et soulignons l’importance d’une politique d’économie d’énergie pour les entreprises. Nous proposons un modèle pour déterminer le bilan énergétique de la fabrication en intégrant les différentes phases productives et non-productives. Nous définissons un double objectif pour la minimisation de la durée de production et de la consommation d’énergie. Nous appliquons ce modèle à l’ordonnancement d’ateliers job-shop flexibles. Pour déterminer la solution optimale nous utilisons deux classes de méthodes : - La première relève des algorithmes génétiques. Nous proposons différents types d’algorithmes pour résoudre ce problème multicritère. Nous proposons par exemple de faire évoluer deux populations pour minimiser respectivement l’énergie consommée et la durée de production et de les croiser pour atteindre l’objectif global. - La seconde relève de la programmation sous contrainte. Nous proposons de rechercher la solution optimale en développant une double arborescence pour évaluer l’énergie consommée et la durée de production. Nous construisons notre algorithme en partant des tâches à réaliser sur les machines ou en partant des machines qui réaliseront les tâches. Nous discutons de la construction du front de Pareto pour l’obtention de la meilleure solution.Nous terminons en comparant les différentes approches et en discutant leur pertinence pour traiter des problèmes de différentes tailles. Nous proposons également plusieurs améliorations et quelques pistes pour de futures recherches. / We present the challenges of environmental management and underline the importance of an energy saving policy for companies. We propose a model to determine the energy balance of manufacturing by integrating the different productive and non-productive phases. We define two purposes for minimizing production time and energy consumption. We apply this model to the scheduling of flexible job-shop workshops. To determine the optimal solution we use two types of methods: - The first is genetic algorithms. We propose different types of algorithms to solve this multi-criteria problem. For example, we propose to develop two populations to minimize the energy consumed and the production time, and to cross them to achieve the overall objective. - The second is constraint programming. We propose to find the optimal solution by developing a double tree to evaluate the energy consumed and the production time. We build our algorithm starting from the tasks to be performed on the machines or from the machines that will perform the tasks. We discuss the construction of the Pareto front to get the best solution.We finish by comparing the different approaches and discussing their relevance to deal with problems of different sizes. We also offer several improvements and some leads for future research.
|
452 |
Sistema imune artificial para o problema de escalonamento Job ShopRibeiro, Sildenir Alves 29 November 2006 (has links)
Made available in DSpace on 2016-12-23T14:33:37Z (GMT). No. of bitstreams: 1
dissertacao.pdf: 1052399 bytes, checksum: b17ce224ca3822e277c997fd00bd2c67 (MD5)
Previous issue date: 2006-11-29 / Este trabalho apresenta um Sistema Imune Artificial (SIA) para tratar problemas de escalonamento. O Sistema Imunológico Artificial desenvolvido neste projeto baseia-se na
estrutura arquitetura e funcionamento dos Sistemas Imunes Biológicos ou Naturais. O uso de Algoritmo Genético (AG) fez-se necessário para gerar os indivíduos a serem escalonados,
representando os antígenos e anticorpos do SIA. Cada indivíduo gerado pelo AG representa um conjunto de tarefas processadas em um conjunto de máquinas. Os indivíduos são
avaliados por uma função de aptidão que representa o processo de seleção natural. A evolução dos indivíduos e consequentemente das populações são obtidas aplicando-se os operadores genéticos de crossover e mutação. As tarefas e as máquinas, utilizadas para o escalonamento, representa o problema de Job Shop Scheduling (JSS). Ao problema, foram
aplicados alguns testes clássicos da literatura, onde se verificou a viabilidade dos SIA para tratamento de problemas de escalonamento. Ainda com os testes, pode-se observar o
comportamento do sistema durante toda a execução, possibilitando assim, uma análise criteriosa das funcionalidades do sistema e dos resultados gerados pela massa de teste, observados durante um período de tempo. A representação dos sistemas imunológicos naturais através de algoritmos computacionais tem inspirado pesquisadores de todo o mundo, a motivação é que os sistemas imunológicos possuem características de paralelismo adaptabilidade e aprendizagem, além da possibilidade de serem aplicados em diversos problemas das mais diversas áreas, devido sua portabilid ade. / This work presents an Artificial Immune System (AIS) to deal with problems scheduling. The Artificial Immunologic System developed in this project was based on the structure,
architecture and functioning of the Biological or Natural Immune Systems. The use of Genetic Algorithm (GA) became necessary to represent the antibodies and antigens of the
AIS. Each individual generated for the GA represented a processed task set library in a set of machines. The evaluation of each individual was given by a fitness function that represents the process of natural selection. The evolution of the individuals, and population as a consequence was obtained by applying the genetic operators of crossover e mutation. The machines and the tasks used for the scheduling represent the problem of Job Shop Scheduling
(JSS). Some classic tests of the literature where applied to the problem in order to verify the viability of the AIS on the treatment of task of scheduling problems. Those tests also
demonstrated the system s behavior its entire execution, therefore, allowing for a detailed analysis of the system s functionalities sets for certain time period. The representation of the natural immunologic systems through computational algorithms inspires from all over world researchers. The motivation is that the immunologic systems possess parallelism
characteristics adaptability and learning, which can be applied in several problems found in many areas, had its portability.
|
453 |
Uma contribuição para o problema de programação de operações flow shop com buffer zero e tempos de setup dependente da sequência e da máquina / A contribution to the flow shop problem with zero buffer and sequence and machine dependent setup timesMauricio Iwama Takano 03 August 2016 (has links)
O problema do sequenciamento da produção diz respeito à alocação das tarefas nas máquinas em um ambiente de fabricação, o qual vem sendo amplamente estudado. O sequenciamento pode variar em tamanho e complexidade dependendo do tipo de ambiente onde ele é aplicado, do número e tipos de restrições tecnológicas e da função objetivo do problema. A utilização de métodos de decisão para a solução de problemas de sequenciamento na indústria depende de modelos que sejam capazes de oferecer soluções para os problemas reais, que geralmente envolvem diversas restrições, os quais devem ser considerados simultaneamente. No presente trabalho o problema de sequenciamento da produção em ambientes flow shop permutacionais, com bloqueio com buffer zero, e com tempos de setup dependente da sequência e da máquina, com o objetivo de minimização do makespan é estudado, sendo este considerado um problema NP-Completo. O problema é pouco explorado na literatura. No presente trabalho é apresentado um procedimento de cálculo para o makespan e três métodos de solução para o problema: quatro limitantes inferiores para o procedimento Branch-and-Bound; quatro modelos MILP, sendo dois deles adaptados; e 28 modelos heurísticos construtivos adaptados para o problema. Os métodos desenvolvidos baseiam-se em propriedades matemáticas do problema que são apresentadas neste trabalho como limitante inferior e limitante superior. Dentre todos os modelos MILP, o modelo adaptado RBZBS1 obteve os melhores resultados para os problemas menores e o modelo desenvolvido TNZBS1 obteve os melhores desvios relativos médios do makespan para os problemas maiores, que não foram resolvidos dentro do limite de tempo computacional estipulado. O limitante inferior para o Branch-and-Bound LBTN2 foi melhor que os demais tanto no tempo computacional e no número de nós explorados como também no número de problemas não resolvidos e no desvio relativo médio do makespan. Foi realizado uma comparação entre o melhor modelo MILP e o melhor limitante inferior para o Branch-and-Bound, sendo que o último obteve melhores resultados para os problemas testados. Entre os métodos heurísticos adaptados, o PF foi o que obteve, de uma forma geral, os melhores resultados em todas as fases. / Production scheduling is defined as a problem of allocating jobs in machines in a production environment and it has been largely studied. The scheduling can vary in difficulty and complexity depending on the environment, the variety and types of technological restraints and the objective function of the problem. The use of decision making methods to solve scheduling problems in the industry needs models that are capable to solve real problems, that usually involve a big variety of restraints that have to be simultaneously studied. At the present work the scheduling problem in a permutational flow shop environment, considering blocking with zero buffer, and sequence and machine dependent setup times, with the objective of minimizing makespan is studied, which is considered a NP-Complete problem and little explored in literature. The work presents a calculation procedure for the makespan and three solution methods for the problem: four lower bounds for the Branch-and-Bound procedure; four MILP models, two of which are adapted; and 28 constructive heuristic methods adapted to the problem. The methods developed are based on mathematical properties of the problem that are presented in this work as a lower bound and an upper bound. Among all the MILP models, the adapted model RBZBS1 was the one to obtain the best results for the smaller problems, and the developed model TNZBS1 obtained the smallest mean relative deviation of the makespan for the bigger problems that were not solved within the specified computational time limit. The lower bound for the Branch-and-Bound LBTN2 obtained smaller computational times and number of explored nodes as well as the number of unsolved problems and the mean relative deviation for the makespan than all other lower bounds. Also, a comparison among the best MILP model and the best lower bound for the Branch-and-Bound was performed, being that the last obtained better results for the tested problems. Among the adapted heuristic methods, the PF heuristic was the one that obtained, in general, the better results in all phases.
|
454 |
Contribution à l'ordonnancement d'ateliers avec ressources de transports / Contribution to job shop scheduling problems with transport resourcesZhang, Qiao 25 July 2012 (has links)
Nos travaux concernent l’étude d’une extension d’un problème d’ordonnancement bien connu sous l’appellation job shop. Nous appelons cette extension le General Flexible Job Shop Scheduling Problem (GFJSSP). Celui-ci se rencontre dans différents types d’ateliers ayant comme caractéristique commune d’être soumis à des contraintes dues à des ressources de transport. Le GFJSSP se caractérise par l’intégration de machines et robots flexibles. Le terme General induit par ailleurs la présence de robots dont la capacité est supposée unitaire dans notre étude, des temps opératoires bornés, et la possibilité de prise en compte d’emplacements de stockage spécifiques. Après avoir défini l’atelier et le problème correspondant à cette extension, nous avons proposé deux modélisations du GFJSSP ainsi défini : une première modélisation mathématique linéaire, et une modélisation graphique, qui correspond à une généralisation du graphe disjonctif couramment utilisé pour les problèmes de job shop. Nous avons ensuite abordé la résolution suivant deux étapes : tout d’abord en nous focalisant sur l’aspect séquencement des tâches de traitement et de transport, pour lequel nous avons élaboré deux méthodes heuristiques (de type Tabou et basée sur une procédure de shifting bottleneck améliorée) ; puis en intégrant dans un deuxième temps la problématique de l’affectation induite par la flexibilité de certaines ressources. Pour cette dernière étape, nous avons combiné les méthodes précédentes avec un algorithme génétique. L’algorithme hybride obtenu nous permet de résoudre des instances de la littérature correspondant à divers cas spécifiques, avec des résultats assez proches des meilleures méthodes dédiées. A termes, il pourrait être intégré dans un système d'aide à la décision général qui s’affranchirait de la phase d’identification préalable du type de job shop considéré, et serait adapté à la résolution de nombreux cas (avec ou sans problème d'affectation, temps de traitement fixes ou bornés, avec ou sans stockage, etc..). / Our work focuses on an extension of the well known job shop scheduling problem. We call this extension the General Flexible Job Shop Scheduling Problem (GFJSSP). It occurs in various kinds of workshops which are particularly constrained by one or several transportation resources (called robots). GFJSSP is characterized by the flexibility of both machines and robots. In the studied problem, the term General involves unitary capacity transportation resources, bounded processing times, and possible input/output buffers for machines. After defining the workshop and the corresponding problem, we proposed two kinds of model for the GFJSSP: a mathematical model, and a graphical one. This last one is a generalization of the disjunctive graph commonly used for job shop problems. We then addressed the resolution in two steps: firstly, by focusing on the sequencing of processing and transportation tasks. For this purpose we have developed two heuristics (Tabu search and an improved shifting bottleneck procedure). Secondly, we have considered the assignment problem involved by the flexibility of some resources. For this last step, we combined the above methods with a genetic algorithm. This hybrid algorithm allowed us to solve various specific cases of instances in the literature, with performance rather close to the best dedicated methods. In the future, it could be integrated within a general decision support system which could emancipate from the initial identification phase of the considered type of job shop, and which would be suitable for solving many cases (with or without assignment problem, fixed or bounded processing times, with or without storage, and so on).
|
455 |
Supply chain management under availability & uncertainty constraints / Le management de la chaîne logistique sous contraintes de disponibilité et d'incertitudeZheng, Yahong 10 October 2012 (has links)
Le management de la chaîne logistique concerne un large éventail d’activités. Nombreuses ceux qui ont un caractère incertain apportant souvent des conséquences inattendues. Malgré cela, l’incertitude est fréquemment non considérée dans la gestion de la chaîne logistique traditionnelle. En plus de l’incertitude, l’indisponibilité des ressources augmentera la complexité du problème. En prenons en compte les contraintes d’incertitude et de disponibilité nous étudions le management de la chaîne logistique selon différents aspects. Cette thèse représente une tentative de recherche afin d’aborder ce problème d’une façon systématique et complète et nous espérons que notre travail contribuera aux futurs travaux de recherche et sera utile aux gestionnaires de la chaîne logistique. Nous nous concentrons sur trois sources classiques de l’incertitude ; celle de la demande, celle la fabrication et celle liée à la distribution. Pour chaque source d’incertitude, nous analysons ses causes et ses impacts sur les performances de la chaîne logistique. L’incertitude est spécifiée dans des problèmes classiques concrets et des approches sont proposées pour les résoudre. Nous nous sommes également focalisés sur le problème bi-niveau de vendeur de journaux qui représente une chaîne logistique miniature, concerné par une double incertitude. Les méthodes utilisées offrent une bonne démonstration du traitement des variables incertaines dans les problèmes de décision / Supply chain management involves a wide range of activities. Among most of them, uncertainty exists inherently and always brings some consequence not expected. However, uncertainty is not considered much in conventional supply chain management. In the case where availability of resources is not what we expect, complexity of supply chain management increases. Taking constraints of uncertainty and availability into account, we aim to discuss supply chain management from different aspects. This thesis is an attempt of systematic and complete research from this point and we would like to offer some references to researchers and managers in supply chain. We focus on three classic sources of uncertainty: demand, manufacturing and distribution. For each source of uncertainty, we analyze its cause and its impact to the performance of the supply chain. Uncertainty is specified into concrete classic problem and an approach is proposed to solve it. Furthermore, bi-level newsboy problem as a miniature of supply chain, is focused under double uncertain environment. Treating uncertain variables is actually a treatment on operational level. The methods used offer good demonstration in treating uncertain variables in decision problems
|
456 |
Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems / Algorithmes métaheuristiques pour minimiser la somme des retards des problèmes d'ordonnancement de type flowshopTa, Quang-Chieu 12 February 2015 (has links)
Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta) heuristiques. Ce type de méthode de résolution a reçu un grand intérêt en raison de leurs très bonnes performances pour résoudre des problèmes difficiles. Nous présentons d’abord les concepts de base d’un problème d’ordonnancement. Nous donnons aussi une brève introduction à la théorie de l’ordonnancement et nous présentons un panel de méthodes de résolution. Enfin, nous considérons un problème où un flow shop de permutation à m-machine et un problème de tournées de véhicules sont intégrés, avec pour objectif la minimisation de la somme des retards. Nous proposons un codage direct d’une solution et une méthode de voisinage. Les résultats montrent que l’algorithme Tabou améliore grandement la solution initiale donnée par EDD et où chaque voyage ne délivre qu’un travail. / We consider in this thesis a permutation flow shop scheduling problem where a set of jobs have to be scheduled on a set of machines. The jobs have to be processed on the machines in the same order. The objective is to minimize the total tardiness. We propose heuristic algorithms and many new matheuristic algorithms for this problem. The matheuristic methods are a new type of approximated algorithms that have been proposed for solving combinatorial optimization problems. These methods embed exact resolution into (meta)heuristic approaches. This type of resolution method has received a great interest because of their very good performances for solving some difficult problems. We present the basic concepts and components of a scheduling problem and the aspects related to these components. We also give a brief introduction to the theory of scheduling and present an overview of resolution methods. Finally, we consider a problem where m-machine permutation flow shop scheduling problem and a vehicle routing problem are integrated and the objective is to minimize the total tardiness. We introduce a direct coding for a complete solution and a Tabu search for finding a sequence and trips. The results show that the TS greatly improves the initial solution given by EDD heuristic where each trip serves only one job at a time.
|
457 |
CodeBuddy : Development of a programming assistance marketplace as a web applicationRenholm, Filip, Möller, Fredrik, Jansson, Isak, Gustafsson, Klara, Johansson Lara, Leo, Bodeström Eriksson, Linus, Thaung, Ludwig, Egondotter, Vendela January 2018 (has links)
According to a study at Linköping University, students who study programming need additional assistance beyond the help provided in the course. According to the same survey, the majority of these students indicate that they would pay for private tuition in programming. At the same time, there are students who believe they have the competence to teach others in programming and could consider of doing this against financial compensation. To meet these needs of students, a solution tested in this thesis resulted in the development of a web application to create a C2C platform where students can meet up to exchange knowledge within programming. The development of the web application is varied by design and functionality substantiated by scientific theories. During the project, user testing is performed to get opinions from the potential target group. The work mainly focuses on answering the research questions regardingconsumer trust of the web application’s design. The report shows that it is possible to develop a web application according to the above criteria.
|
458 |
Reducing Greenhouse Gas Emissions Through the Use of Free Shops : A Case Study of Two Free Shops in GothenburgNord, Iza January 2018 (has links)
Products, throughout their life cycle from production to waste management, create emissions of greenhouse gases (GHG). This leads to environmental impacts on the climate (Swedish Environmental Protection Agency, 2016). The consumed products from households are increasing (World Wildlife Fund, 2008) and so is the waste generated from them (Avfall Sverige, n.d.). A more sustainable development generating from circular economy should be focused on to increases the reuse of products and by so reduce the amount of waste generated (Göteborgs Stad, n.d.a.) This study have examined if the use of Free Shops can help the city of Gothenburg to reach higher up the waste management hierarchy towards reuse and prevention, and if carbon dioxide equivalents (CO2e) can be avoided by using Free Shops. Two Free Shops with the purpose to increase reuse in Gothenburg have been studied and their effect on GHG emissions, presented as CO2e, have been analysed. A Life Cycle Inventory Study (LCI) has been conducted on all, but two, different materials entering the Free Shops for four weeks, including the production, waste management, transportation and storage. The result of the study shows that a mean of 10 ton CO2e per Free Shop per year can be avoided when reusing at a Free Shop instead of buying new products. This equals leaving a low energy lamp on for approximately 590 years (World Wildlife Fund, 2009) based on a low energy lamp using 0,007 kWh (Eon, 2007). To examine if the Free Shops can reduce the amount of waste disposed of by households in Gothenburg the material entering the Free Shops was weight and analysed to estimate how it corresponded to the amount of waste disposed of. The result shows that the material entering a Free Shop only corresponds to 0.0025 percent of the household waste disposed of in the city. This indicates that Free Shops by themselves will not solve the problem with increasing amounts of waste and emissions from increasing production. However, they can help in a small scale. / <p>20180625</p>
|
459 |
Estudo comparativo das aproximações baseadas no método de decomposição paramétrico para avaliar redes de filas de manufatura utilizando planejamento de experimentos / A comparative study of approximations based on the parametric decomposition method to evaluate manufacturing queueing networks using designing of experimentsCamorim, José Eduardo Vieira 29 February 2008 (has links)
Made available in DSpace on 2016-06-02T19:51:35Z (GMT). No. of bitstreams: 1
1770.pdf: 2888839 bytes, checksum: 18c57ba21e9192d597b74f8d1d0fc997 (MD5)
Previous issue date: 2008-02-29 / Universidade Federal de Minas Gerais / This is a study of approximations based on parametric decomposition methods
used in open queueing networks for modeling discrete job-shop manufacturing systems. These
approximations play an important role in evaluating the performance of productive systems and
have proved effective in many situations. Besides, these approximations are relatively easy to
apply requiring fewer data compared to other methods because they use the average rate and SCV
(square coefficient of variation) as the only parameters to characterize the network arrival and
service processes. This work is aimed at analyzing and comparing several approximations since
they are not yet available in the literature. Hence, several network situations were tested in order
to identify the most adequate approximation for each situation. Firstly, a two-station network was
analyzed followed by the analysis of a five-station network and lastly, a real example of a
semiconductor plant, analyzed by Bitran e Tirupati (1988), was used. In order to reach these
goals, the state of the art of approximation methods to evaluate the performance of open queueing
networks was studied, and the approximations were compared using the experiment planning
technique, important factors for building network configuration and data analysis The findings of
this work demonstrate that approximations can be highly efficient to evaluate the performance of
discrete job-shop manufacturing systems. Regardless of the configurations studied, it is worth
mentioning that approximations 3 and 2, in general, showed the best results if compared to the
other values obtained from simulations to evaluate the performance of open queueing networks,
OQN,. The other approximations tended to overestimate E(Lj) when the number of stations is
higher. This study intends to contribute to the development of computing systems in order to
support project decisions and the planning and control of discrete manufacturing systems using
approximations based on the parametric decomposition method / Esta dissertação estuda as aproximações baseadas nos métodos analíticos
paramétricos de decomposição usados em redes de filas abertas que modelam sistemas discretos
de manufatura do tipo job-shop. Estas aproximações possuem um importante papel na avaliação
do desempenho de sistemas produtivos e vem se mostrando eficiente para uma grande
diversidade de situações. Além disso, são aproximações relativamente fáceis de serem
aplicadas, necessitando poucos dados em relação a outros métodos, pois utilizam apenas a
média e o scv (coeficiente quadrático de variação) como parâmetros para caracterizar os
processos de chegadas e os processos de serviço da rede. O foco deste trabalho está em realizar
análises e comparações entre diversas aproximações, pois ainda não existe nenhuma
comparação mais efetiva entre elas na literatura. Para isso, diversas situações de redes foram
exploradas para identificar quais aproximações são mais adequadas para quais situações.
Primeiramente é analisado uma rede com 2 estações, posteriormente uma outra com 5 estações
e por fim usou um exemplo real de uma fábrica de semi-condutores, analisada por Bitran e
Tirupati (1988). Para que seja possível atingir esses objetivos, estudou-se o estado da arte das
aproximações dos métodos de avaliação de desempenho para redes de filas abertas, e comparouse
as aproximações por meio de técnicas de planejamento de experimentos, parte importante na
construção das configurações das redes e análise dos resultados. Os resultados apresentados
nesta dissertação mostram que essas aproximações podem ser bem eficientes ao avaliar o
desempenho de sistemas discretos de manufatura do tipo job-shop. Independente das
configurações analisadas, vale destacar a Aproximação 3 e a Aproximação 2, em geral, obtendo
os melhores resultados, entre as aproximações, em comparação aos valores obtidos pela
simulação para avaliar o desempenho de redes de filas OQN. As outras aproximações
demonstraram certo comportamento em sobreestimar E(Lj), quando o número de estações
aumentam. Este estudo pretende contribuir para o desenvolvimento de sistemas computacionais
13
para apoiar decisões de projeto, planejamento e controle dos sistemas discretos de manufatura,
usando aproximações baseadas em métodos de decomposição paramétrico
|
460 |
Propagace elektronického obchodu / Promotion of E-commerceSekanina, Petr January 2015 (has links)
This thesis is focused on proposals of promotion specific e-shop. The purpose of this thesis is to design such forms of promotion which are going to be effective and accessible even for smaller and starting e-shops. In the theoretical part I am introducing common knowledge needed for understanding the e-shops and internet marketing topics, then I analyze current state and position on the market and finally I evaluate separate forms of promotion including suggestions for their use by this selected e-shop.
|
Page generated in 0.0189 seconds