Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I 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. (c) 2006 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

A coupling cutting stock-lot sizing problem in the paper industry

An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.

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 hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

An approach for solving the lot-sizing problem of a market-driven foundry

Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. Journal of the Operational Research Society (2010) 61, 108-114. doi:10.1057/jors.2008.151

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.

Novel immunoadjuvants based on cationic lipid: Preparation, characterization and activity in vivo

The interactions between three different protein antigens and dioctadecyldimethylammonium bromide (DODAB) dispersed in aqueous solutions from probe sonication or adsorbed its one bilayer onto particles was comparatively investigated. The three model proteins were bovine serum albumin (BSA), purified 18 kDa/14 kDa antigens from Taenia crassiceps (18/14-Tcra) and a recombinant, heat-shock protein hsp-18 kDa from Mycobacterium leprae. Protein-DODAB complexes in water solution were characterized by dynamic light scattering for sizing and zeta-potential analysis. Cationic complexes (80-100 nm of mean hydrodynamic diameter) displayed sizes similar to those of DODAB bilayer fragments (BF) in aqueous solution and good colloid stability over a range of DODAB and protein concentrations. The amount of cationic lipid required for attaining zero of zeta-potential at a given protein amount depended on protein nature being smaller for 18 kDa/14 kDa antigens than for BSA. Mean diameters for DODAB/protein complexes increased, whereas zeta-potentials decreased with NaCl or protein concentration. In mice, weak IgG production but significant cellular immune responses were induced by the complexes in comparison to antigens alone or carried by aluminum hydroxide as shown from IgG in serum determined by ELISA, delayed type hypersensitivity reaction from footpad swelling tests and cytokines analysis. The novel cationic adjuvant/protein complexes revealed good colloid stability and potential for vaccine design at a reduced DODAB concentration. (C) 2009 Elsevier Ltd. All rights reserved.

Silica-based cationic bilayers as immunoadjuvants

Background: Silica particles cationized by dioctadecyldimethylammonium bromide (DODAB) bilayer were previously described. This work shows the efficiency of these particulates for antigen adsorption and presentation to the immune system and proves the concept that silica-based cationic bilayers exhibit better performance than alum regarding colloid stability and cellular immune responses for vaccine design. Results: Firstly, the silica/DODAB assembly was characterized at 1 mM NaCl, pH 6.3 or 5 mM Tris. HCl, pH 7.4 and 0.1 mg/ml silica over a range of DODAB concentrations (0.001-1 mM) by means of dynamic light scattering for particle sizing and zeta-potential analysis. 0.05 mM DODAB is enough to produce cationic bilayer-covered particles with good colloid stability. Secondly, conditions for maximal adsorption of bovine serum albumin (BSA) or a recombinant, heat-shock protein from Mycobacterium leprae (18 kDa-hsp) onto DODAB-covered or onto bare silica were determined. At maximal antigen adsorption, cellular immune responses in vivo from delayed-type hypersensitivity reactions determined by foot-pad swelling tests (DTH) and cytokines analysis evidenced the superior performance of the silica/DODAB adjuvant as compared to alum or antigens alone whereas humoral response from IgG in serum was equal to the one elicited by alum as adjuvant. Conclusion: Cationized silica is a biocompatible, inexpensive, easily prepared and possibly general immunoadjuvant for antigen presentation which displays higher colloid stability than alum, better performance regarding cellular immune responses and employs very low, micromolar doses of cationic and toxic synthetic lipid.

Complete Clinical Response after Neoadjuvant Chemoradiation for Distal Rectal Cancer

Multimodality treatment of rectal cancer, with the combination of radiation therapy, chemotherapy, and surgery has become the preferred approach to locally advanced rectal cancer The use of neoadjuvant chemoradiation therapy (CRT) has resulted in reduced toxicity rates, significant tumor down-sizing and downstaging, better chance of sphincter preservation, and improved functional results A proportion of patients treated with neoadjuvant CRT may ultimately develop complete clinical response Management of these patients with complete clinical response remains controversial and approaches including radical resection, transanal local excision, and observation alone without immediate surgery have been proposed The use of strict selection criteria of patients after neoadjuvant CRT has resulted in excellent long-term results with no oncological compromise after observation alone in patients with complete clinical response Recurrences are detectable by clinical assessment and frequently amenable to salvage procedures

Interaction of cationic bilayer fragments with a model oligonucleotide

The interaction between cationic bilayer fragments and a model oligonucleotide was investigated by differential scanning calorimetry, turbidimetry, determination of excimer to monomer ratio of 2-(10-(1-pyrene)-decanoyl)-phosphatidyl-choline in bilayer fragment dispersions and dynamic light scattering for sizing and zeta-potential analysis. Salt (Na(2)HPO(4)), mononucleotide (2`-deoxyadenosine-5`-monophosphate) or poly (dA) oligonucleotide (3`-AAA AAA AAA A-5`) affected structure and stability of dioctadecyldimethylammonium bromide bilayer fragments. Oligonucleotide and salt increased bilayer packing due to bilayer fragment fusion. Mononucleotide did not reduce colloid stability or did not cause bilayer fragment fusion. Charge neutralization of bilayer fragments by poly (dA) at 1:10 poly (dA):dioctadecyldimethylammonium bromide molar ratio caused extensive aggregation, maximal size and zero of zeta-potential for the assemblies. Above charge neutralization, assemblies recovered colloid stability due to charge overcompensation. For bilayer fragments/poly (dA), the nonmonotonic behavior of colloid stability as a function of poly (dA) concentration was unique for the oligonucleotide and was not observed for Na(2)HPO(4) or 2`-deoxyadenosine-5`-monophosphate. For the first time, such interactions between cationic bilayer fragments and mono- or oligonucleotide were described in the literature. Bilayer fragments/oligonucleotide assemblies may find interesting applications in drug delivery. (c) 2010 Elsevier B.V. All rights reserved.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Optimized harvest scheduling in eucalyptus plantations under operational, spatial and climatic constraints

The representation of sustainability concerns in industrial forests management plans, in relation to environmental, social and economic aspects, involve a great amount of details when analyzing and understanding the interaction among these aspects to reduce possible future impacts. At the tactical and operational planning levels, methods based on generic assumptions usually provide non-realistic solutions, impairing the decision making process. This study is aimed at improving current operational harvesting planning techniques, through the development of a mixed integer goal programming model. This allows the evaluation of different scenarios, subject to environmental and supply constraints, increase of operational capacity, and the spatial consequences of dispatching harvest crews to certain distances over the evaluation period. As a result, a set of performance indicators was selected to evaluate all optimal solutions provided to different possible scenarios and combinations of these scenarios, and to compare these outcomes with the real results observed by the mill in the study case area. Results showed that it is possible to elaborate a linear programming model that adequately represents harvesting limitations, production aspects and environmental and supply constraints. The comparison involving the evaluated scenarios and the real observed results showed the advantage of using more holistic approaches and that it is possible to improve the quality of the planning recommendations using linear programming techniques.

Influence of light and temperature on seed germination of Cereus pernambucensis Lemaire (Cactaceae)

The objective of the present study was to evaluate the effects of light and temperature on germination of Cereus pernambucensis seeds, a species of columnar cactus native to Brazil and naturally incident in the restinga. Cereus pernambucensis seeds were incubated under different temperatures, from 5 to 45 °C, with 5 °C intervals, and under alternating temperatures of 15-20 °C, 15-30 °C, 20-25 °C, 20-30 °C, 20-35 °C, 25-30 °C, 25-35 °C, and 30-35 °C, both under continuous white light and dark. The seeds were also incubated in a gradient of phytochrome photoequilibrium at 25 °C. The highest percentage germination in this species was between 25 and 30 °C. The minimum temperature was between 15 and 20 °C and the maximum between 35 and 40 °C. Alternating temperatures did not affect the percentage of seed germination, but it did alter the rate and synchronization indexes. Seeds incubated in the dark did not germinate under any of the conditions tested, indicating that this species when cultivated present light sensitive seeds controlled by phytochrome. The seeds can tolerate a lot of shade conditions, germinating under very low fluence response of phytochrome.