51 resultados para MIP Mathematical Programming Job Shop Scheduling
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Mecânica - FEG
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
Pós-graduação em Engenharia Elétrica - FEIS
Resumo:
This paper presents a study to determine the optimal support positions in bridges, as well as the optimal relation between the spans of beams, aiming both the reduction and the unifirmization of the efforts in these structures. The mathematical problem is formulated in order to minimize the maximum bending moments, taking the coordinate of each internal support as design variable. To take into account possible location limitations, size constraints are also considered in the formulation. The software developed based on this study determines the efforts in each support for load shifting along the structure by the usage of the Displacement Method, and the optimization is performed with a mathematical programming technique. The structures analyzed from the computational implementation of the idealized model point to the validation and efficiency of the proposed procedure.
Resumo:
This work aimed to develop an optimization methodology for reservoir sizing in rainwater harvesting systems in order to increase the economic viability of projects in this area. For this, concepts of Operations Research were used so as to develop mathematical programming problems related to minimizing the life cycle cost and maximizing efficiency. The results obtained for different sizing methods were presented based on a case study, emphasizing the importance of tools that are able to provide a more accurate analysis and tend to significantly increase the economic viability of rainwater harvesting systems.
Resumo:
This article evaluates the efficiency of Brazil's industrial sectors from 1996 to 2009, taking into account energy consumption and respective contributions to the country's economic and social aspects. This analysis used a mathematical programming method called Data Envelopment Analysis (DEA), which enabled, from the SBM model and the window analysis, to evaluate the ability of industries to reduce energy consumption and fossil-fuel CO2 emissions (inputs), as well as to increase the Gross Domestic Product (GDP) by sectors, the persons employed and personnel expenses (outputs). The results of this study indicated that the Textile sector is the most efficient industrial sector in Brazil, according to the variables used, followed by these sectors: Foods and Beverages, Chemical, Mining, Paper and Pulp, Nonmetallic and Metallurgical.
Resumo:
A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.
Resumo:
Minimizing the makespan of a flow-shop no-wait (FSNW) schedule where the processing times are randomly distributed is an important NP-Complete Combinatorial Optimization Problem. In spite of this, it can be found only in very few papers in the literature. By considering the Start Interval Concept, this problem can be formulated, in a practical way, in function of the probability of the success in preserve FSNW constraints for all tasks execution. With this formulation, for the particular case with 3 machines, this paper presents different heuristics solutions: by integrating local optimization steps with insertion procedures and by using genetic algorithms for search the solution space. Computational results and performance evaluations are commented. Copyright (C) 1998 IFAC.
Resumo:
A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)