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 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.

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.

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.

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 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.

Clinical relationships and ethical problems in primary care, Sao Paulo, SP, Brazil

Objectives: Main Objective: to identify ethical problems in primary care according to nurses` and doctors` perceptions. Secondary Objective: to know ethical issues of patient-professional relationships in primary care. Design: Synthesis to integrate and reinterpret primary results of qualitative studies. Setting: Primary healthcare centers, Sao Paulo, SP, Brazil. Participants and/or context: Incidental sample of 34 nurses and 36 medical doctors working in primary healthcare centers selected by convenience. Methods: Individual, semi-structured interviews to identity situations considered as sources of ethical problems. The sample is socially representative of primary care health centers and professionals. Data collection assured discourse saturation. Hermeneutic-dialectical discourse analysis was used to study the results. Results: Patient-professional relationships and team work were the main sources of ethical problems. The most important problems were patient information, privacy, confidentiality, interpersonal relationship, linkage and patient autonomy. These issues reflect the recent changes in clinical relation ships and show the peculiarities of primary care with its continuous care which lasts a long time. Healthcare involves multiprofessional team work in the midst of the patient claims for autonomy. Good care of patients needs requires a relationship based on communication and cooperation, and includes feelings and values, with communication skills. Conclusions: Ethical problems in primary care are common situations. For quality and humane primary care the relationship should consist of dialogue, trust and cooperation. (C) 2009 Elsevier Espana, S.L. All rights reserved.

Wavelet-Galerkin method for one-dimensional elastoplasticity and damage problems: Constitutive modeling and computational aspects

This work presents an analysis of the wavelet-Galerkin method for one-dimensional elastoplastic-damage problems. Time-stepping algorithm for non-linear dynamics is presented. Numerical treatment of the constitutive models is developed by the use of return-mapping algorithm. For spacial discretization we can use wavelet-Galerkin method instead of standard finite element method. This approach allows to locate singularities. The discrete formulation developed can be applied to the simulation of one-dimensional problems for elastic-plastic-damage models. (C) 2007 Elsevier Inc. All rights reserved.

A Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard`s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. (C) 2007 Elsevier Ltd. All rights reserved.

The impact of perinatal and socioeconomic factors on mental health problems of children from a poor Brazilian city: a longitudinal study

Low birth weight and preterm birth, and social disadvantage may negatively affect mental health of children, but findings have been inconsistent. To assess the influence of perinatal and social factors on mental health problems in children aged 7-9 years. A random sample of 805 births in So Luis, Brazil was studied in 1997/1998 and again in 2005/2006. Perinatal, socioeconomic and demographic variables were assessed within 24 h after delivery. The Strengths and Difficulties Questionnaire (SDQ) was used to assess mental health problems in the children. Simple and multiple Poisson regressions were used for statistical analysis. The overall prevalence of mental health problems in the total sample was 47.7%. The prevalences of emotional and conduct problems were 58.2 and 48.8%, respectively. Only paternal age (< 20 years) was associated with mental health problems as measured by the full SDQ scale (prevalence ratio PR = 1.27). Children born to single mothers (PR = 1.31) and those with birth weight from 1,500 to 2,499 g (PR = 1.18) and from 2,500 to 2,999 g (PR = 1.17) had a higher risk of emotional problems, but those from low income families had a lower risk (PR = 0.80). Children with a father of less than 20 years had a higher risk of having problems with their peers (PR = 1.75). A maternal education of 9 years or over was inversely associated with peer (PR = 0.70) and conduct problems (PR = 0.73). Girls had a lower risk of conduct (PR = 0.77) and hyperactivity problems (PR = 0.68). A maternal education of 4 years or less increased the risk of hyperactivity (PR = 1.48). Socioeconomic and demographic conditions were better predictors of mental health problems in children than birth weight or preterm birth. However, since most effect sizes were small most mental health problems were, unexplained by the variables in the study.

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.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Anti-oxidative and anti-ulcerogenic activity of Ipomoea imperati

Ipomoea imperati (Vahl) Griseb., Convolvulaceae, is used in traditional medicine for the treatment of inflammation, swelling and wounds, as well as to treat pains and stomach problems. This work evaluates the anti-oxidative activity by ESR (Electron Spin Resonance spectroscopy) and the preventive and curative actions of I. imperati in gastric ulcer animal model. Ipomoea imperati (200 mg/kg, p.o.) prevented the formation of gastric lesions in 78% (p<0.05) when compared with the negative control tween 80. Lanzoprazole, prevented in 85% the gastric lesions formation induced by ethanol (p<0.05). Therefore, the oral administration of I. imperati one hour before the ulcerogenic agent prevented the ulcer formation, conserving the citoprotection characteristics of the gastric mucosa and assuring the integrity of gastric glands and gastric fossets. The healing activity of I. imperati (200 mg/kg, p.o.) evaluated in chronic ulcer experiments induced by the acetic acid, was 72% (p<0.05). The positive control, ranitidine, healed 78% of the gastric lesions (p<0.05). The histological analysis confirmed the recovery of the mucosal layer and the muscle mucosal layer harmed by the acetic acid. Experiments in vitro with DPPH (2.2-diphenyl-1-picrylhydrazyl) of anti-oxidative activity demonstrated that I. imperati presents an IC50 of 0.73±0.01 mg/mL.

Surface dental enamel lead levels and antisocial behavior in Brazilian adolescents

Lead poisoning has been reportedly linked to a high risk of learning disabilities, aggression and criminal offenses. To study the association between lead exposure and antisocial/delinquent behavior, a cross-sectional study was conducted with 173 Brazilian youths aged 14\201318 and their parents (n = 93), living in impoverished neighborhoods of Bauru-SP, with high criminality indices. Self-Reported Delinquency (SRD) and Child Behavior Checklist (CBCL) questionnaires were used to evaluate delinquent/antisocial behavior. Body lead burdens were evaluated in surface dental enamel acid microbiopsies. The dental enamel lead levels (DELL) were quantified by graphite furnace atomic absorption spectrometry (GFAAS) and phosphorus content was measured using inductively coupled plasma optical emission spectrometry (ICP-OES). Logistic regression was used to identify associations between DELL and each scale defined by CBCL and SRD scores. Odd ratios adjusted for familial and social covariates, considering a group of youths exposed to high lead levels (\2265 75 percentile), indicated that high DELL is associated with increased risk of exceeding the clinical score for somatic complaints, social problems, rule-breaking behavior and externalizing problems (CI 95 per cent). High DELL was not found to be associated with elevated SRD scores. In conclusion, our data support the hypothesis that high-level lead exposure can trigger antisocial behavior, which calls for public policies to prevent lead poisoning