Revising customer profitability measurement in a paper industry company

Tämän tutkimuksen tavoitteena oli selvittää, pitäisikö trimmihävikin kustannukset lisätä case yrityksen asiakaskannattavuuslaskelmaan. Trimmihävikin vaihtelua asiakkaiden välillä tutkittiin yhdellä case yrityksen tuotantolinjalla. Myös tilaustekijöiden sekä ajankohdan vaikutusta trimmihävikin määrään selvitettiin. Teoreettinen viitekehys rakennettiin asiakaskannattavuuden ja asiakassuhteiden johtamisen ympärille. Tutkimuksen empiirisessä osassa hyödynnettiin kvantitatiivista tutkimusmenetelmää ja tilastollisissa analyyseissä käytettiin laajaa aineistoa. Tulokset osoittivat, että trimmihävikin määrä vaihteli asiakkaiden kesken. Asiakkaista muodostettiin kolme klusteria. Näiden klustereiden tarkempi tutkiminen osoitti selvän yhteyden asiakkaan ostokäyttäytymisen ja trimmihävikin välillä. Lopuksi tutkimuksen tulosten hyödyntämismahdollisuuksia pohdittiin ja myös tutkimuksen rajoitukset tunnistettiin.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

O problema de corte de estoque em indústrias de móveis de pequeno e médio portes

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

Inferência fuzzy para o problema de corte de estoque com sobras aproveitáveis de material

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

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Modelos matemáticos para o problema integrado de dimensionamento de lotes e corte de estoque undimensional

Pós-graduação em Matemática - IBILCE

Estratégias para a redução de ciclos da serra no problema de corte de estoque na indústria moveleira

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

Aplicação de técnicas de decomposição em problemas de corte de estoque

Pós-graduação em Matemática - IBILCE

Solução do problema de corte bidimensional de peças retângulares tipo não-guilhotinado usando simulated annealing

Pós-graduação em Engenharia Elétrica - FEIS

Uma abordagem multiobjetivo para o problema de corte de estoque unidimensional

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Contribuições para o problema de corte de estoque bidimensional na indústria moveleira

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

Propostas de solução para o problema de corte de estoque bidimensional de uma fábrica de móveis de pequeno porte

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

Problemas de corte e empacotamento na indústria de móveis: um estudo de caso

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Modelagem do problema integrado de dimensionamento de lotes e corte de estoque em indústria moveleira

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)