The one-dimensional cutting stock problem with usable leftovers - A survey

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Transformation of wealth produced into quality of life: analysis of the social efficiency of nation-states with the DEA's triple index approach

Although an essential condition for the occurrence of human development, economic growth is not always efficiently converted into quality of life by nation-states. Accordingly, the objective of this study is to measure the social efficiency-the ability of a nation-state to convert its produced wealth into quality of life-of a set of 101 countries. To achieve this goal, the Data Envelopment Analysis method was used in its standard, cross-multiplicative and inverted form, by means of a new approach called 'triple index'. The main results indicated that the former Soviet republics and Eastern European countries stood out in terms of social efficiency. The developed countries, notwithstanding their high social indicators, did not excel in efficiency; however, the countries of south of Africa, despite having the worst social conditions, were also the most inefficient.

Aplicação da teoria das restrições na manufatura de uma empresa siderúrgica

The competition among companies nowadays, caused by globalization and with customers more and more demanding, makes the companies rethink their strategies for survival. To improve their competition the companies are adopting management tool to improve the manufacturing management, which is considered a key to success. The present study aimed to develop a method, based on techniques of theory of constraints and operational research, to ensure the best use of resources and best decision of a production line on a steel company, with focus in the customers’ delivery time, which is a requirement of the current market. The conclusion of this study is that the correct use of the management tools, such as theory of constraints and operational research, can ensure a long survival for the companies that duel for the market share, especially in regard to customers’ delivery time, that generates their satisfaction

Novo algoritimo genético para problemas de cobertura de conjuntos

The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.

Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Metodologia para análise de sistema de transporte coletivo por ônibus através de indicadores de qualidade

Pós-graduação em Engenharia de Produção - FEB

Metodologia para otimização em subcontratação de serviço de usinagem

Operational Research (OR) is an eminent science to business competitiveness and the capacity of algorithms and spreadsheets that exist today allows people to apply them for a lower cost and with less complexity. However, spreadsheets linked to OR techniques, when directed to real problems, are still little explored in their full potential. In order to use them better, this article utilizes the Microsoft Office Excel to solve an optimization practical problem and decision-making of machining subcontracting. In general, although considered a frequent problem, is not of easy solution, optimize the mix of production versus outsourcing, because of the restrictions and resources available, it requests investments in specific software. In this way, this research aims to develop software to be called SOSU (Optimization Software for Machining Subcontracting). SOSU should introduce the best mix of internal and subcontracted machining for n types of parts that, over a certain period of time t, maximize capacity and meet all the demand at the lowest cost possible. The methodology adopted follows the bibliographic reference and it is assumed that the necessary data to prove from mathematical modeling of production areas and from a system of costs already structured. The nature of the problem justifies the application of Linear Programming (LP), Visual Basic for Applications (VBA) is used for computational implementation and interface with the user and the supplement Solver to find the solution. The analysis of the experiments show that the SOSU optimizes resources and improves the decision-making process, besides an easy operation, it can be implemented or quickly adapted and without the need of large investments.

O problema de corte de estoque com uso e venda de retalhos: uma proposta de otimização para a sustentabilidade ambiental

Pós-graduação em Engenharia de Produção - FEB

Reformulações para o problema integrado de dimensionamento e sequenciamento da produção

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

The aim of solving the Optimal Power Flow problem is to determine the optimal state of an electric power transmission system, that is, the voltage magnitude and phase angles and the tap ratios of the transformers that optimize the performance of a given system, while satisfying its physical and operating constraints. The Optimal Power Flow problem is modeled as a large-scale mixed-discrete nonlinear programming problem. This paper proposes a method for handling the discrete variables of the Optimal Power Flow problem. A penalty function is presented. Due to the inclusion of the penalty function into the objective function, a sequence of nonlinear programming problems with only continuous variables is obtained and the solutions of these problems converge to a solution of the mixed problem. The obtained nonlinear programming problems are solved by a Primal-Dual Logarithmic-Barrier Method. Numerical tests using the IEEE 14, 30, 118 and 300-Bus test systems indicate that the method is efficient. (C) 2012 Elsevier B.V. All rights reserved.

Integrating on-line process control and imperfect corrective maintenance: An economical design

Existing studies of on-line process control are concerned with economic aspects, and the parameters of the processes are optimized with respect to the average cost per item produced. However, an equally important dimension is the adoption of an efficient maintenance policy. In most cases, only the frequency of the corrective adjustment is evaluated because it is assumed that the equipment becomes "as good as new" after corrective maintenance. For this condition to be met, a sophisticated and detailed corrective adjustment system needs to be employed. The aim of this paper is to propose an integrated economic model incorporating the following two dimensions: on-line process control and a corrective maintenance program. Both performances are objects of an average cost per item minimization. Adjustments are based on the location of the measurement of a quality characteristic of interest in a three decision zone. Numerical examples are illustrated in the proposal. (c) 2012 Elsevier B.V. All rights reserved.

Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing problem with backlogging and setup carryover and crossover. The first is in line with other models from the literature, whereas the second considers a disaggregated setup variable, which tracks the starting and completion times of the setup operation. This innovative approach permits a more compact formulation. Computational results show that the proposed models have outperformed other state-of-the-art formulation.