The problem of production scheduling of manufacturing systems involves the system modeling task and the application of a technique to solve it. This kind of scheduling is characterized by the large number of possible solutions, where several researches have been using the genetic algorithms as a search method to solve this problem, since these algorithms have the capacity of globally exploring the search space and to find good solutions quickly. This paper proposes the use of adaptive genetic algorithm to solve this kind of scheduling problem. The aim of this paper was to obtain a good production schedule considering simultaneous use of machines and automated guided vehicles that minimize the makespan with low running time. The results of this paper were validated in large scenarios and compared with other approach. These results are presented and discussed in this paper.
The main objective of this chapter is to present the separation theorems, important consequences of Hahn-Theorem theorem. Therefore, we begin with an overview on convex sets and convex functionals. Then go on with the Hahn-Banach theorem and separation theorems. Follow these results specification: first for normed spaces and then for a subclass of these spaces, the Hilbert spaces. In this last case plays a key role the Riesz representation theorem. Separation theorems are key results in convex programming. Then the chapter ends with the outline of applications of these results in convex programming, Kuhn-Tucker theorem, and in minimax theorem, two important tools in operations research, management and economics, for instance.
Resumo -Este artigo demonstra a possibilidade de se utilizar o robô Mindstorm NTX 2.0, modelo 8547, da empresa fabricante Lego, para ensino de Gestão de Projeto de Software. Para isso apresenta um experimento no qual duas equipes desenvolveram um projeto de software utilizando o robô e aplicaram processos de gestão de projetos. Foram feitas duas formas de avaliação, a primeira, por meio das quais se verificou a existência das técnicas relacionadas a gestão de projeto e a segunda mapeou os resultados obtidos do próprio projeto, a fim de verificar se a gestão do projeto influenciou nos resultados como esperado. Ao final do experimento constatou-se que é possível utilizar o robô Lego como objeto de aprendizagem sobre Gestão de Projeto de Software.
Palavras chaves-Gestão de Projeto de Software, Objeto de Aprendizagem, Mindstorm, Lego.Abstract-This paper reports an experience on using the robot Lego Mindstorm NXT 2.0, model 8547, to support the teaching of Software Project Management. We conducted an experiment in which two teams developed a software project using the robot, while applying principles of project management. The experiment was divided into two parts. First, we verified the existence of related project management techniques. Second, we mapped the results obtained by the project in order to verify whether the project management had impacted on the results, as expected. We conclude that the Lego robot is a motivational factor for the students and can be adopted as a learning object in the teaching of Software Project Management.
In everyday life it is common to deal with some situations that involve the need to determine a general rule to describe them. To help in the description of phenomena that involve quantities that can be expressed in terms of polynomial functions, there is a need to find instruments that facilitate obtaining such polynomial functions from the data analyzed in the process. An easy way to obtain polynomial functions from a sequence of real numbers is through the study of Higher Order Arithmetic Sequences. If the sequence obtained from the data collected through an experiment is polynomial, then this sequence is called an arithmetic sequence of order k, where k is the degree of the polynomial. With the study of higher order arithmetic sequences it is possible to obtain from a sequence of real numbers both the formula that describes this sequence and the formula for the sum of the first n terms of this sequence. With this, we will be able to obtain general formulas that allow us to obtain an estimate for the behavior of different phenomena. Thus, through the bibliographic survey, consulting the reference [1], the research project began with weekly meetings.
In this work we define Magic Polygons P (n, k) and Degenerated Magic Polygons D(n, k) and we obtain their main properties, such as the magic sum and the value corresponding to the root vertex. The existence of magic polygons P (n, k) and degenerated magic polygons D(n, k) are discussed for certain values of n and k.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.