Nutritional information of meals supplied by companies, participating in the workers` meal program in Sao Paulo, Brazil

Objective. To compare the nutritional value of meals provided by companies participating in the Workers` Meal Program in the city of Sao Paulo, Brazil, to the nutritional recommendations and guidelines established by the Ministry of Health for the Brazilian population. Methods. The 72 companies studied were grouped according to economic sector (industrial, services, or commerce), size (micro, small, medium, or large), meal preparation modality (prepared on-site by the company itself, on-site by a hired caterer, or off-site by a hired caterer), and supervision by a dietitian (yes or no). The per capita amount of food was determined based on the lunch, dinner, and supper menus for three days. The nutritional value of the meals was defined by the amount of calories, carbohydrates, protein, total fat, polyunsaturated fat, saturated fat, trans fat, sugars, cholesterol, and fruits and vegetables. Results. Most of the menus were deficient in the number of fruits and vegetables (63.9%) and amount of polyunsaturated fat (83.3%), but high in total fat (47.2%) and cholesterol (62.5%). Group 2, composed of mostly medium and large companies, supervised by a dietician, belonging to the industrial and/or service sectors, and using a hired caterer, on averaged served meals with higher calorie content (P < 0.001), higher percentage of polyunsaturated fat (P < 0.001), more cholesterol (P = 0.015), and more fruits and vegetables (P < 0.001) than Group 1, which was composed of micro and small companies from the commercial sector, that prepare the meals themselves on-site, and are not supervised by a dietitian. Regarding the nutrition guidelines set for the Brazilian population, Group 2 meals were better in terms of fruit and vegetable servings (P < 0.001). Group I meals were better in terms of cholesterol content (P = 0.05). Conclusions. More specific action is required targeting company officers and managers in charge of food and nutrition services, especially in companies without dietitian supervision.

Fatigue and workability in Brazilian textile companies in different corporate social responsibility score groups

The aim of this study was to evaluate working conditions in the textile industry for different stages of Corporate Social Responsibility (CSR) development, and workers` perception of fatigue and workability. A cross-sectional study was undertaken with 126 workers in the production areas of five Brazilian textile plants. The corporate executive officers and managers of each company provided their personal evaluations of CSR. Companies were divided into 2 groups (higher and lower) of CSR scores. Workers completed questionnaires on fatigue, workability and working conditions. Ergonomic job analysis showed similar results for working conditions, independent of their CSR score. Multivariate analysis models were developed for fatigue and workability, indicating that they are both associated to factors related to working conditions and individual workers` characteristics and life styles. Work organization, (what, how, when, where and for how long the work is done), is also an associated factor for fatigue. This study suggests that workers` opinions should be taken into greater consideration when companies develop their CSR programs, in particular for those relating to working conditions. Relevance to industry: This paper underlines the importance of considering working conditions and workers` opinions of them, work organization and individual workers` characteristics and life styles in order to restore or to maintain workability and to reduce fatigue, independently of how developed a company may be in the field of Corporate Social Responsibility. (C) 2010 Elsevier B.V. All rights reserved.

CONSIDERATIONS ON THE REINTRODUCTION AND RECOVERY OF THE ALAGOAS CURASSOW MITU MITU (LINNAEUS, 1766) FROM EXTINCTION USING A POTENTIALLY HYBRID CAPTIVE STOCK

The Alagoas Curassow Mitu mitu is considered extinct in the wild. Since 1979, two females and a male caught in the wild have bred successfully in captivity, and, in 1990, hybridizations between M. mitu and Razor-billed Mitu M. tuberosum were performed. By June 2008, there were around 130 living birds in two different aviaries. We sequenced two regions of the mitochondrial DNA of both captive stocks of Alagoas Curassows. We unequivocally identified hybrids that have haplotype typical of M. tuberosum. However, unless the original studbook can be recovered there is no confident way to discriminate ""pure"" M. mitu birds for breeding and reintroduction purposes. Allied with morphological data gathered in an independent study, we suggest that conservation actions need to focus on specimens with diagnostic phenotypic characters of M. mitu, and avoid birds with mitochondria, genetic contribution of M. tuberosum. Although we have detected low levels of genetic variability among captive birds, the steady increase of the captive population suggests that inbreeding depression and hybridization are not a reproductive hindrance. Reintroduction of some of these potential hybrid birds in the original area of occurrence of the Alagoas Curassow may be the only hope to fill in the ecological niche left vacant. An educational program involving local communities to conserve future reintroduction of curassows and their restored habitat is highly recommended. Accepted 12 November 2009.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 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.

The web of connections between tourism companies: Structure and dynamics

Tourism destination networks are amongst the most complex dynamical systems, involving a myriad of human-made and natural resources. In this work we report a complex network-based systematic analysis of the Elba (Italy) tourism destination network, including the characterization of its structure in terms of several traditional measurements, the investigation of its modularity, as well as its comprehensive study in terms of the recently reported superedges approach. In particular, structural (the number of paths of distinct lengths between pairs of nodes, as well as the number of reachable companies) and dynamical features (transition probabilities and the inward/outward activations and accessibilities) are measured and analyzed, leading to a series of important findings related to the interactions between tourism companies. Among the several reported results, it is shown that the type and size of the Companies influence strongly their respective activations and accessibilities, while their geographical position does not seem to matter. It is also shown that the Elba tourism network is largely fragmented and heterogeneous, so that it could benefit from increased integration. (C) 2009 Elsevier B.V. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.