A new MILP based approach for unit commitment in power production planning

This paper presents a complete, quadratic programming formulation of the standard thermal unit commitment problem in power generation planning, together with a novel iterative optimisation algorithm for its solution. The algorithm, based on a mixed-integer formulation of the problem, considers piecewise linear approximations of the quadratic fuel cost function that are dynamically updated in an iterative way, converging to the optimum; this avoids the requirement of resorting to quadratic programming, making the solution process much quicker. From extensive computational tests on a broad set of benchmark instances of this problem, the algorithm was found to be flexible and capable of easily incorporating different problem constraints. Indeed, it is able to tackle ramp constraints, which although very important in practice were rarely considered in previous publications. Most importantly, optimal solutions were obtained for several well-known benchmark instances, including instances of practical relevance, that are not yet known to have been solved to optimality. Computational experiments and their results showed that the method proposed is both simple and extremely effective.

A recoverable production planning model

Aware of the importance of developing new alternatives to improve the performance of the companies, our purpose in this paper is to develop a medium term production planning model that deals with the concepts of Partnership and Reverse Logistics. Our model takes advantage of the synergies of integration, developing a model for global production planning that generates the optimal production and purchasing schedule for all the companies integrating a logistic chain. In a second part of the paper we incorporate products returns to the first model proposed, and analyze the implications they have over this model. We use some examples with different configurations of supply chains varying the number of production plants, distribution centers and recovery plants. To solve the model we have combined optimization and simulation procedures.

Sheeting efficiency improvement through production planning and control development.

Arkitus on kartongin jatkojalostusmuoto, jonka tehokkuus muodostuu monen tekijän vaikutuksesta. Tämän työn tavoitteena oli parantaa arkitustehokkuutta tutkitussa kahden folioleikkurin arkittamossa tuotannonsuunnittelun ja tuotannonohjauksen kehittämisellä. Kartonkitehtaan sisäisessä jalostusketjussa arkitus on viimeinen vaihe, mikä tekee siitä pitkälti riippuvaisen edeltävistä konevaiheista, eli kartonkikoneista ja PE-päällystyskoneista. Pelkkä arkituksen tuotannonsuunnittelun huomiointi ei siis vielä takaa hyvää lopputulosta arkitustehokkuuden kannalta. Folioarkitustoiminta on hyvin asiakassuuntautunutta. Arkkikoot määräytyvät asiakkaiden omien tarpeiden perusteella, jolloin eri arkkikokojen kokonaismäärä kasvaa huomattavan suureksi. Viime vuosien trendinä on ollut tilauseräkokojen pieneneminen. Näiden tekijöiden yhteisvaikutuksena arkituksen tuotantoprosessille on ominaista erilaisten asetusten aiheuttama katkonaisuus. Lisäksi pelkästään yhden millimetrin muutos arkin leveydessä voi usein vaikuttaa arkitustehokkuuteen hyvinkin merkittävästi. Näistä syistä arkituksen tuotannonsuunnittelun apuvälineeksi tarvitaan tarkkuuteen ja joustavuuteen kykenevää tietojärjestelmää. Tehokkaan tuotannonohjauksen tueksi tarvitaan lisäksi erilaisia leikkuri- ja kartonkilaatukohtaisia raportteja. Työn teoriaosassa käsitellään tarkemmin arkitustoiminnan ominaisuuksia ja sen tehokkuuteen vaikuttavia tekijöitä. Lisäksi käsitellään tuotannonsuunnittelun ja tuotannonohjauksen periaatteita ja toimintoja.

Production planning development in global manufacturing company

Larox Corporation is a provider of full service filtration in solid and liquid separation. Larox develops, designs, manufactures and supplies industrial filters. By Larox’s continuous development principle, a project for more efficient production was started. At the same time production planning was taken under review. Aim for this Master’s thesis was to find software designed for production planning purposes replacement for old Microsoft Excel based method. In this Master’s thesis current way of production planning was thoroughly analyzed and improvement targets were specified and also requirements for new software were assigned. Primary requirements for new software were possibility to production scheduling, planning, follow-up and also for long-time capacity planning and tracking. Also one demand was that new software should have data link to Larox’s current ERP-system. Result of this Master’s thesis was to start using Larox’s ERP-system also for production planning purposes. New mode of operation fulfils all requirements which were placed to new system. By using new method of production planning, production planners can get more easier and reliable data than from current system.

Production planning and optimization of a pulp mill: introduction of the optimisation based scheduling software for pulp industry

The objective of this project was to introduce a new software product to pulp industry, a new market for case company. An optimization based scheduling tool has been developed to allow pulp operations to better control their production processes and improve both production efficiency and stability. Both the work here and earlier research indicates that there is a potential for savings around 1-5%. All the supporting data is available today coming from distributed control systems, data historians and other existing sources. The pulp mill model together with the scheduler, allows what-if analyses of the impacts and timely feasibility of various external actions such as planned maintenance of any particular mill operation. The visibility gained from the model proves also to be a real benefit. The aim is to satisfy demand and gain extra profit, while achieving the required customer service level. Research effort has been put both in understanding the minimum features needed to satisfy the scheduling requirements in the industry and the overall existence of the market. A qualitative study was constructed to both identify competitive situation and the requirements vs. gaps on the market. It becomes clear that there is no such system on the marketplace today and also that there is room to improve target market overall process efficiency through such planning tool. This thesis also provides better overall understanding of the different processes in this particular industry for the case company.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. 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.

The application of preprocessing and cutting plane techniques for a class of production planning problems

This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.

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.

A Fuzzy Goal Programming model for solving aggregate production-planning problems under uncertainty: A case study in a Brazilian sugar mill

This paper proposes a Fuzzy Goal Programming model (FGP) for a real aggregate production-planning problem. To do so, an application was made in a Brazilian Sugar and Ethanol Milling Company. The FGP Model depicts the comprehensive production process of sugar, ethanol, molasses and derivatives, and considers the uncertainties involved in ethanol and sugar production. Decision-makings, related to the agricultural and logistics phases, were considered on a weekly-basis planning horizon to include the whole harvesting season and the periods between harvests. The research has provided interesting results about decisions in the agricultural stages of cutting, loading and transportation to sugarcane suppliers and, especially, in milling decisions, whose choice of production process includes storage and logistics distribution. (C)2014 Elsevier B.V. All rights reserved.

A Study of Different Subsequence Elimination Strategies for the Soft Drink Production Planning

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

A knapsack problem as a tool to solve the production planning problem in small foundries

According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) determining the alloys to be merged and (2) determining the lots that will be produced. The purpose of this study is to draw up plans of minimum production cost for the lot-sizing problem for small foundries. As suggested in the literature, the proposed heuristic addresses the problem stages in a hierarchical way. Firstly, the alloys are determined and, subsequently, the items that are produced from them. In this study, a knapsack problem as a tool to determine the items to be produced from furnace loading was proposed. Moreover, we proposed a genetic algorithm to explore some possible sets of alloys and to determine the production planning for a small foundry. Our method attempts to overcome the difficulties in finding good production planning presented by the method proposed in the literature. The computational experiments show that the proposed methods presented better results than the literature. Furthermore, the proposed methods do not need commercial software, which is favorable for small foundries. (C) 2010 Elsevier Ltd. All rights reserved.

A Column-Generation Approach for a Short-Term Production Planning Problem in Closed-Loop Supply Chains

We present a new model formulation for a multi-product lot-sizing problem with product returns and remanufacturing subject to a capacity constraint. The given external demand of the products has to be satisfied by remanufactured or newly produced goods. The objective is to determine a feasible production plan, which minimizes production, holding, and setup costs. As the LP relaxation of a model formulation based on the well-known CLSP leads to very poor lower bounds, we propose a column-generation approach to determine tighter bounds. The lower bound obtained by column generation can be easily transferred into a feasible solution by a truncated branch-and-bound approach using CPLEX. The results of an extensive numerical study show the high solution quality of the proposed solution approach.

Optimal production planning for PCB assembly

It is indisputable that printed circuit boards (PCBs) play a vital role in our daily lives. With the ever-increasing applications of PCBs, one of the crucial ways to increase a PCB manufacturer’s competitiveness in terms of operation efficiency is to minimize the production time so that the products can be introduced to the market sooner. Optimal Production Planning for PCB Assembly is the first book to focus on the optimization of the PCB assembly lines’ efficiency. This is done by: • integrating the component sequencing and the feeder arrangement problems together for both the pick-and-place machine and the chip shooter machine; • constructing mathematical models and developing an efficient and effective heuristic solution approach for the integrated problems for both types of placement machines, the line assignment problem, and the component allocation problem; and • developing a prototype of the PCB assembly planning system. The techniques proposed in Optimal Production Planning for PCB Assembly will enable process planners in the electronics manufacturing industry to improve the assembly line’s efficiency in their companies. Graduate students in operations research can familiarise themselves with the techniques and the applications of mathematical modeling after reading this advanced introduction to optimal production planning for PCB assembly.

A production planning system for plastic footwear in a seasonal market

Modern injection-moulding machinery which produces several, pairs of plastic footwear at a time brought increased production planning problems to a factory. The demand for its footwear is seasonal but the company's manning policy keeps a fairly constant production level thus determining the aggregate stock. Production planning must therefore be done within the limitations of a specified total stock. The thesis proposes a new production planning system with four subsystems. These are sales forecasting, resource planning, and two levels of production scheduling: (a) aggregate decisions concerning the 'manufacturing group' (group of products) to be produced in each machine each week, and (b) detailed decisions concerning the products within a manufacturing group to be scheduled into each mould-place. The detailed scheduling is least dependent on improvements elsewhere so the sub-systems were tackled in reverse order. The thesis concentrates on the production scheduling sub-systems which will provide most. of the benefits. The aggregate scheduling solution depends principally on the aggregate stocks of each manufacturing group and their division into 'safety stocks' (to prevent shortages) and 'freestocks' (to permit batch production). The problem is too complex for exact solution but a good heuristic solution, which has yet to be implemented, is provided by minimising graphically immediate plus expected future costs. The detailed problem splits into determining the optimal safety stocks and batch quantities given the appropriate aggregate stocks. It.is found that the optimal safety stocks are proportional to the demand. The ideal batch quantities are based on a modified, formula for the Economic Batch Quantity and the product schedule is created week by week using a priority system which schedules to minimise expected future costs. This algorithm performs almost optimally. The detailed scheduling solution was implemented and achieved the target savings for the whole project in favourable circumstances. Future plans include full implementation.