Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Quantification of the environmental impacts of road conditions in Brazil

This study evaluates the impacts of Brazilian highway conditions on fuel consumption and, consequently, on carbon dioxide (COO emissions. For the purpose of this study, highway conditions refer to the level of highway maintenance: the incidence of large potholes, large surface cracks, uneven sections, and debris. Primary computer collected data related to the fuel consumption of three types of trucks were analyzed. The data were derived from 88 trips taken over six routes, each route representative of one of two highway conditions: better or worse. Study results are initially presented for each type of truck being monitored. The results are then aggregated to approximate the entire Brazilian highway network. In all cases, results confirmed environmental benefits resulting from travel over the better routes. There was found to be an increase in energy efficiency from traveling better roads, which resulted in lower fuel consumption and lower CO(2) emissions. Statistical analysis of the results suggests that, in general, fuel consumption data were significant at *P < 0.05, rejecting the null hypothesis that average fuel consumption from traveling the better routes is statistically equal to average fuel consumption from traveling the worse routes. Improved Brazilian road conditions would generate economic benefits, reduce dependency on and consumption of fossil fuels (due to the increase in energy efficiency), and reduce CO(2) emissions. These findings may have additional relevancy if Brazil needs to reduce carbon dioxide emissions to reach future Kyoto Protocol`s emissions targets, which should take effect in January 2013. (c) 2008 Elsevier B.V. All rights reserved.

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Consumer purchase habits and views on food safety: A Brazilian study

This study aimed to evaluate the attitudes towards food safety among consumers in the city of So Paulo, the major consumer market in Brazil. Focus group sessions were conducted with 30 adults responsible for food choices and purchases. Results indicated a preference for supermarkets over street markets, for the variety of foods, convenience and confidence in the safety assurance. On the other hand, the ""naturalness"" of the products in the street markets was the main reason for purchases in those places. Participants showed concerns with respect to food additives, hormones and pesticides - technological rather than ""natural"" hazards. Minimally processed and ready-to-eat foods were considered convenient products meeting the need for time/labor-savings in the kitchen, although suspicion about wholesomeness and safety came up among consumers. Lack of awareness regarding potentially risky behaviors was observed, including handling and storage of foods in the domestic environment. In conclusion, this study suggests that Brazilian regulators should create more effective risk communication combining technical information with actual consumer perceptions of food risks. (C) 2010 Elsevier Ltd. All rights reserved.

In vitro safety assessment of papain on human skin: A qualitative Light and Transmission Electron Microscopy (TEM) study

Papain is a thiol proteolytic enzyme widely used in dermatology that found applications in wound treatment. Recently, papain was also used as absorption enhancer which can modify the peptide/ protein material in the bilayer domain. We investigated papain safety using human skin that was exposed to papain in vitro at different times: 4, 24 and 48 hours. The samples were examined using Light and Transmission Electron Microscopy (TEM) to study of the mechanisms involved in enhancer-skin interaction. After 24 hours, changes occurred in corneosomes. However, samples of 48 hours did not show major changes in agreement with the control. These findings indicated that papain could be used safely onto the skin.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Health and safety issues in contemporary dental practice

Under current workplace health and safety legislation, the owners and managers of a dental practice have a legal responsibility to provide staff with a safe working environment. In this article, the emphasis will be on four common areas of risk: posture when seated, handling scalpel blades, flooring and lighting.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

Effects of data characteristics on the results of reserve selection algorithms

We tested the effects of four data characteristics on the results of reserve selection algorithms. The data characteristics were nestedness of features (land types in this case), rarity of features, size variation of sites (potential reserves) and size of data sets (numbers of sites and features). We manipulated data sets to produce three levels, with replication, of each of these data characteristics while holding the other three characteristics constant. We then used an optimizing algorithm and three heuristic algorithms to select sites to solve several reservation problems. We measured efficiency as the number or total area of selected sites, indicating the relative cost of a reserve system. Higher nestedness increased the efficiency of all algorithms (reduced the total cost of new reserves). Higher rarity reduced the efficiency of all algorithms (increased the total cost of new reserves). More variation in site size increased the efficiency of all algorithms expressed in terms of total area of selected sites. We measured the suboptimality of heuristic algorithms as the percentage increase of their results over optimal (minimum possible) results. Suboptimality is a measure of the reliability of heuristics as indicative costing analyses. Higher rarity reduced the suboptimality of heuristics (increased their reliability) and there is some evidence that more size variation did the same for the total area of selected sites. We discuss the implications of these results for the use of reserve selection algorithms as indicative and real-world planning tools.

Genetic algorithms for design of liquid retaining structure

In this paper, genetic algorithm (GA) is applied to the optimum design of reinforced concrete liquid retaining structures, which comprise three discrete design variables, including slab thickness, reinforcement diameter and reinforcement spacing. GA, being a search technique based on the mechanics of natural genetics, couples a Darwinian survival-of-the-fittest principle with a random yet structured information exchange amongst a population of artificial chromosomes. As a first step, a penalty-based strategy is entailed to transform the constrained design problem into an unconstrained problem, which is appropriate for GA application. A numerical example is then used to demonstrate strength and capability of the GA in this domain problem. It is shown that, only after the exploration of a minute portion of the search space, near-optimal solutions are obtained at an extremely converging speed. The method can be extended to application of even more complex optimization problems in other domains.