964 resultados para Job Shop, Train Scheduling, Meta-Heuristics
Resumo:
This paper presents a genetic algorithm for the resource constrained multi-project scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a heuristic that builds parameterized active schedules based on priorities, delay times, and release dates defined by the genetic algorithm. The approach is tested on a set of randomly generated problems. The computational results validate the effectiveness of the proposed algorithm.
Resumo:
This paper is on the self-scheduling for a power producer taking part in day-ahead joint energy and spinning reserve markets and aiming at a short-term coordination of wind power plants with concentrated solar power plants having thermal energy storage. The short-term coordination is formulated as a mixed-integer linear programming problem given as the maximization of profit subjected to technical operation constraints, including the ones related to a transmission line. Probability density functions are used to model the variability of the hourly wind speed and the solar irradiation in regard to a negative correlation. Case studies based on an Iberian Peninsula wind and concentrated solar power plants are presented, providing the optimal energy and spinning reserve for the short-term self-scheduling in order to unveil the coordination benefits and synergies between wind and solar resources. Results and sensitivity analysis are in favour of the coordination, showing an increase on profit, allowing for spinning reserve, reducing the need for curtailment, increasing the transmission line capacity factor. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
With advancement in computer science and information technology, computing systems are becoming increasingly more complex with an increasing number of heterogeneous components. They are thus becoming more difficult to monitor, manage, and maintain. This process has been well known as labor intensive and error prone. In addition, traditional approaches for system management are difficult to keep up with the rapidly changing environments. There is a need for automatic and efficient approaches to monitor and manage complex computing systems. In this paper, we propose an innovative framework for scheduling system management by combining Autonomic Computing (AC) paradigm, Multi-Agent Systems (MAS) and Nature Inspired Optimization Techniques (NIT). Additionally, we consider the resolution of realistic problems. The scheduling of a Cutting and Treatment Stainless Steel Sheet Line will be evaluated. Results show that proposed approach has advantages when compared with other scheduling systems
Resumo:
This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.
Resumo:
The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.
Resumo:
- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm
Resumo:
This paper presents a genetic algorithm for the multimode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. The objective function is the minimization of the construction project completion time. To solve the problem, is applied a two-level genetic algorithm, which makes use of two separate levels and extend the parameterized schedule generation scheme by introducing an improvement procedure. It is evaluated the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that this approach is a competitive algorithm.
Resumo:
OBJECTIVE To analyze whether gender influence survival results of kidney transplant grafts and patients.METHODS Systematic review with meta-analysis of cohort studies available on Medline (PubMed), LILACS, CENTRAL, and Embase databases, including manual searching and in the grey literature. The selection of studies and the collection of data were conducted twice by independent reviewers, and disagreements were settled by a third reviewer. Graft and patient survival rates were evaluated as effectiveness measurements. Meta-analysis was conducted with the Review Manager® 5.2 software, through the application of a random effects model. Recipient, donor, and donor-recipient gender comparisons were evaluated.RESULTS : Twenty-nine studies involving 765,753 patients were included. Regarding graft survival, those from male donors were observed to have longer survival rates as compared to the ones from female donors, only regarding a 10-year follow-up period. Comparison between recipient genders was not found to have significant differences on any evaluated follow-up periods. In the evaluation between donor-recipient genders, male donor-male recipient transplants were favored in a statistically significant way. No statistically significant differences were observed in regards to patient survival for gender comparisons in all follow-up periods evaluated.CONCLUSIONS The quantitative analysis of the studies suggests that donor or recipient genders, when evaluated isolatedly, do not influence patient or graft survival rates. However, the combination between donor-recipient genders may be a determining factor for graft survival.
Resumo:
ABSTRACT OBJECTIVE To estimate the prevalence of hypertension among adolescent Brazilian students. METHODS A systematic review of school-based cross-sectional studies was conducted. The articles were searched in the databases MEDLINE, Embase, Scopus, LILACS, SciELO, Web of Science, CAPES thesis database and Trip Database. In addition, we examined the lists of references of relevant studies to identify potentially eligible articles. No restrictions regarding publication date, language, or status applied. The studies were selected by two independent evaluators, who also extracted the data and assessed the methodological quality following eight criteria related to sampling, measuring blood pressure, and presenting results. The meta-analysis was calculated using a random effects model and analyses were performed to investigate heterogeneity. RESULTS We retrieved 1,577 articles from the search and included 22 in the review. The included articles corresponded to 14,115 adolescents, 51.2% (n = 7,230) female. We observed a variety of techniques, equipment, and references used. The prevalence of hypertension was 8.0% (95%CI 5.0–11.0; I2 = 97.6%), 9.3% (95%CI 5.6–13.6; I2 = 96.4%) in males and 6.5% (95%CI 4.2–9.1; I2 = 94.2%) in females. The meta-regression failed to identify the causes of the heterogeneity among studies. CONCLUSIONS Despite the differences found in the methodologies of the included studies, the results of this systematic review indicate that hypertension is prevalent in the Brazilian adolescent school population. For future investigations, we suggest the standardization of techniques, equipment, and references, aiming at improving the methodological quality of the studies.
Resumo:
Dissertation submitted for a PhD degree in Electrical Engineering, speciality of Robotics and Integrated Manufacturing from the Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia
Resumo:
In this paper, a mixed-integer quadratic programming approach is proposed for the short-term hydro scheduling problem, considering head-dependency, discontinuous operating regions and discharge ramping constraints. As new contributions to earlier studies, market uncertainty is introduced in the model via price scenarios, and risk aversion is also incorporated by limiting the volatility of the expected profit through the conditional value-at-risk. Our approach has been applied successfully to solve a case Study based on one of the main Portuguese cascaded hydro systems, requiring a negligible computational time.
Resumo:
This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.
Resumo:
O presente trabalho tem como principais objetivos caracterizar os trabalhos efetuados ao longo do estágio realizado na Tramel, empresa de serralharia civil, e efetuar um estudo de avaliação de fornecedores de alumínio. O estágio desenvolveu-se essencialmente no departamento comercial e de orçamentos e no departamento de qualidade da empresa. De forma a poder desenvolver um trabalho que reunisse informação destas duas áreas foi realizado um estudo de avaliação de fornecedores de alumínio em termos de custos e de qualidade. Assim este trabalho começa por descrever o que são as serralharias, dando especial atenção aos principais materiais utilizados na empresa e tipos de tratamento usados. Depois faz uma breve referência à evolução histórica da orçamentação, distinguindo os diferentes tipos de custos e ainda à qualidade e à importância de um sistema de gestão de qualidade numa empresa. Posteriormente são referidos os trabalhos efetuados ao longo do estágio que foram previamente definidos no plano de trabalhos. Por fim é apresentado o estudo de avaliação de fornecedores de alumínio. Foram estudados os quatro principais fornecedores de alumínio da empresa e para diversos tipos de caixilhos foi determinado o custo, distinguindo no final a percentagem necessária de perfis, acessórios, tratamento, mão de obra para fabrico, lacagem e sobras. Depois é realizada uma avaliação em termos de qualidade com base em inquéritos distribuídos aos colaboradores. Finalizado o estudo realizado são tiradas conclusões e sugeridas perspetivas futuras.
Resumo:
O problema do escalonamento, por ser um dos factores fundamentais na tomada de decisão para uma boa gestão das operações, tem sido alvo de um amplo estudo, tanto na sua componente teórica como na sua componente prática. A importância de um escalonamento correto das operações é preponderante, quando as pequenas diferenças, em termos de tempos de produção, podem ter um grande impacto na competitividade da organização. Em muitas unidades produtivas, existem máquinas capazes de realizar as mesmas operações com diferentes desempenhos. Isto pode dever-se à necessidade de flexibilizar os recursos ou mesmo a uma atualização da capacidade produtiva. Embora os problemas de máquinas diferentes em paralelo tenham sido alvo de um vasto estudo, muitos deles não são passíveis de ser resolvidos através de métodos exatos. O problema de minimização do makespan (Rm||Cmax), é NP-hard, sendo habitualmente abordado através de heurísticas. Entre as heurísticas utilizadas em problemas de minimização do makespan em máquinas diferentes em paralelo, é possível identificar duas filosofias de afectação: a que utiliza os tempos de processamento para alocar as tarefas e a que utiliza as datas de conclusão. Nesta dissertação, pretende-se dar uma contribuição para a resolução do problema de afectação de recursos em sistemas de produção. Para tal, foram propostas as heurísticas OMTC 3 e Suffrage One. A contribuição consiste na proposta de versões híbridas e modificadas das heurística MCT e Suffrage, uma vez identificadas várias características que podem limitar o seu desempenho, como o facto da heurística MCT alocar as tarefas numa ordem aleatória ou a heurística Suffrage alocar mais que uma tarefa por iteração. Finalmente, procedeu-se à realização de testes computacionais, para avaliar o desempenho das heurísticas propostas. Os testes realizados permitiram concluir que a heurística OMTC 3 apresentou um melhor desempenho que a heurística MCT.
Resumo:
Descrição do Processo de Revisão da futura ISO 9001:2015, principais alterações, benefícios e dificuldades expectáveis.