An efficient heuristic for total flowtime minimisation in no-wait flowshops

In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of minimising the total completion time. This problem is well-known for being nondeterministic polynomial-time hard, and therefore, most contributions to the topic focus on developing algorithms able to obtain good approximate solutions for the problem in a short CPU time. More specifically, there are various constructive heuristics available for the problem [such as the ones by Rajendran and Chaudhuri (Nav Res Logist 37: 695-705, 1990); Bertolissi (J Mater Process Technol 107: 459-465, 2000), Aldowaisan and Allahverdi (Omega 32: 345-352, 2004) and the Chins heuristic by Fink and Voa (Eur J Operat Res 151: 400-414, 2003)], as well as a successful local search procedure (Pilot-1-Chins). We propose a new constructive heuristic based on an analogy with the two-machine problem in order to select the candidate to be appended in the partial schedule. The myopic behaviour of the heuristic is tempered by exploring the neighbourhood of the so-obtained partial schedules. The computational results indicate that the proposed heuristic outperforms existing ones in terms of quality of the solution obtained and equals the performance of the time-consuming Pilot-1-Chins.

Efficient Modeling of Thin Wires in a Lossy Medium by Finite Elements Applied to Grounding Systems

A procedure is proposed to accurately model thin wires in lossy media by finite element analysis. It is based on the determination of a suitable element width in the vicinity of the wire, which strongly depends on the wire radius to yield accurate results. The approach is well adapted to the analysis of grounding systems. The numerical results of the application of finite element analysis with the suitably chosen element width are compared with both analytical results and those computed by a commercial package for the analysis of grounding systems, showing very good agreement.

Recycling Krylov subspaces for efficient large-scale electrical impedance tomography

Electrical impedance tomography (EIT) captures images of internal features of a body. Electrodes are attached to the boundary of the body, low intensity alternating currents are applied, and the resulting electric potentials are measured. Then, based on the measurements, an estimation algorithm obtains the three-dimensional internal admittivity distribution that corresponds to the image. One of the main goals of medical EIT is to achieve high resolution and an accurate result at low computational cost. However, when the finite element method (FEM) is employed and the corresponding mesh is refined to increase resolution and accuracy, the computational cost increases substantially, especially in the estimation of absolute admittivity distributions. Therefore, we consider in this work a fast iterative solver for the forward problem, which was previously reported in the context of structural optimization. We propose several improvements to this solver to increase its performance in the EIT context. The solver is based on the recycling of approximate invariant subspaces, and it is applied to reduce the EIT computation time for a constant and high resolution finite element mesh. In addition, we consider a powerful preconditioner and provide a detailed pseudocode for the improved iterative solver. The numerical results show the effectiveness of our approach: the proposed algorithm is faster than the preconditioned conjugate gradient (CG) algorithm. The results also show that even on a standard PC without parallelization, a high mesh resolution (more than 150,000 degrees of freedom) can be used for image estimation at a relatively low computational cost. (C) 2010 Elsevier B.V. All rights reserved.

A Functional Verification Methodology Based on Parameter Domains for Efficient Input Stimuli Generation and Coverage Modeling

Modern Integrated Circuit (IC) design is characterized by a strong trend of Intellectual Property (IP) core integration into complex system-on-chip (SOC) architectures. These cores require thorough verification of their functionality to avoid erroneous behavior in the final device. Formal verification methods are capable of detecting any design bug. However, due to state explosion, their use remains limited to small circuits. Alternatively, simulation-based verification can explore hardware descriptions of any size, although the corresponding stimulus generation, as well as functional coverage definition, must be carefully planned to guarantee its efficacy. In general, static input space optimization methodologies have shown better efficiency and results than, for instance, Coverage Directed Verification (CDV) techniques, although they act on different facets of the monitored system and are not exclusive. This work presents a constrained-random simulation-based functional verification methodology where, on the basis of the Parameter Domains (PD) formalism, irrelevant and invalid test case scenarios are removed from the input space. To this purpose, a tool to automatically generate PD-based stimuli sources was developed. Additionally, we have developed a second tool to generate functional coverage models that fit exactly to the PD-based input space. Both the input stimuli and coverage model enhancements, resulted in a notable testbench efficiency increase, if compared to testbenches with traditional stimulation and coverage scenarios: 22% simulation time reduction when generating stimuli with our PD-based stimuli sources (still with a conventional coverage model), and 56% simulation time reduction when combining our stimuli sources with their corresponding, automatically generated, coverage models.

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.

Simple and Efficient Access to 3-Ethoxycarbonylpyrroles, Benzofurans, and Naphthofurans

An efficient method was developed for the synthesis of pyrrole and furan derivatives from enamines, phenols, and naphthols. The key steps involve iodocyclization and alumina-induced dehydroiodination reactions.

Chiral Triphenylprolinol Ligands for the Efficient Catalytic Asymmetric Arylation of Aldehydes

The synthesis of new chiral amino alcohols by Heck arylation of an enecarbamate is described. These compounds were used as chiral ligands for the catalytic asymmetric arylation of aldehydes and can be easily recovered. Chiral, nonracemic diarylmethanols were obtained in high yields and enantioselectivities.

Highly efficient palladium-catalyzed Suzuki-Miyaura reactions of potassium aryltrifluoroborates with 5-iodo-1,3-dioxin-4-ones in water: an approach to alpha-aryl-beta-ketoesters

The high efficient palladium-catalyzed Suzuki-Miyaura reactions of potassium aryltrifluoroborates 3 with 5-iodo-1,3-dioxin-4-ones 2a-b in water as only solvent in the presence of n-Bu(4)NOH as base is reported. The respective 5-aryl-1,3-dioxin-4-ones 4a-n were obtained in good to excellent yields. The catalyst system provides high efficiency at low load using electronically diverse coupling partners. The obtained 2,2,6-trimethyl-5-aryl-1,3-dioxin-4-ones were transformed into corresponding alpha-aryl-beta-ketoesters 6 by reaction with an alcohol in the absence of solvent. (C) 2009 Elsevier Ltd. All rights reserved.

Copper salt-catalyzed homo-coupling reaction of potassium alkynyltrifluoroborates: a simple and efficient synthesis of symmetrical 1,3-diynes

The copper-catalyzed dimerization of alkynyltrifluoroborates proceeds readily with good yields. The homo-coupling reaction can be effected in DMSO, in the open air, using Cu(OAc)(2) as catalyst in the absence of any other additives. A variety of functional groups are tolerated. (C) 2008 Elsevier Ltd. All rights reserved.

Efficient sonochemical synthesis of novel 3,5-diaryl-4,5-dihydro-1H-pyrazole-1-carboximidamides

An Ultrasound-assisted preparation of a series of novel 3,5-diaryl-4,5-dihydro-1H-pyrazole-1-carboximidamides that proceeds via the efficient reaction of chalcones with aminoguanidine hydrochloride under clean conditions is described. (C) 2009 Elsevier B.V. All rights reserved.

Computationally efficient solution techniques for adsorption problems involving steep gradients in bidisperse particles

A piecewise uniform fitted mesh method turns out to be sufficient for the solution of a surprisingly wide variety of singularly perturbed problems involving steep gradients. The technique is applied to a model of adsorption in bidisperse solids for which two fitted mesh techniques, a fitted-mesh finite difference method (FMFDM) and fitted mesh collocation method (FMCM) are presented. A combination (FMCMD) of FMCM and the DASSL integration package is found to be most effective in solving the problems. Numerical solutions (FMFDM and FMCMD) were found to match the analytical solution when the adsorption isotherm is linear, even under conditions involving steep gradients for which global collocation fails. In particular, FMCMD is highly efficient for macropore diffusion control or micropore diffusion control. These techniques are simple and there is no limit on the range of the parameters. The techniques can be applied to a variety of adsorption and desorption problems in bidisperse solids with non-linear isotherm and for arbitrary particle geometry.

A scheme for efficient quantum computation wtih linear optics

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

Can globalisation result in less efficient and more vulnerable industries?

Growing economic globalisation (a means of market extension) may increase the economic vulnerability of firms in modern industries, especially those in which firms experience substantial economies of scale. The possibility is explored that globalisation activates competitive pressures that forces firms into a situation where their leverage (fixed costs relative to variable costs, or overhead cost relative to operating costs or capital intensity) rises substantially. Consequently, they become increasingly vulnerable to a sudden adverse change in economic conditions, such as a collapse in the demand for their industry’s product. This is explored for monopolistically competitive markets and also for oligopolistic markets of the type considered and modelled by Sweezy using kinked demand curves. In addition, globalisation is hypothesised to induce firms to become more uniformly efficient. While this has static efficiency advantages, this lack of heterogeneity in productive efficiency of firms can make for economic inefficiency in the adjustment of the industry to altered economic conditions. It is shown that lack of variation in the economic efficiency of firms can impede the speed of market adjustment to new equilibria and may destabilise market equilibria.

Efficient transformation and regeneration of diverse cultivars of peanut (Arachis hypogaea L.) by particle bombardment into embryogenic callus produced from mature seeds

Peanut, one of the world's most important oilseed crops, has a narrow germplasm base and lacks sources of resistance to several major diseases. The species is considered recalcitrant to transformation, with few confirmed transgenic plants upon particle bombardment or Agrobacterium treatment. Reported transformation methods are limited by low efficiency, cultivar specificity, chimeric or infertile transformants, or availability of explants. Here we present a method to efficiently transform cultivars in both botanical types of peanut, by (1) particle bombardment into embryogenic callus derived from mature seeds, (2) escape-free (not stepwise) selection for hygromycin B resistance, (3) brief osmotic desiccation followed by sequential incubation on charcoal and cytokinin-containing media; resulting in efficient conversion of transformed somatic embryos into fertile, non-chimeric, transgenic plants. The method produces three to six independent transformants per bombardment of 10 cm(2) embryogenic callus. Potted, transgenic plant lines can be regenerated within 9 months of callus initiation, or 6 months after bombardment. Transgene copy number ranged from one to 20 with multiple integration sites. There was ca. 50% coexpression of hph and luc or uidA genes coprecipitated on separate plasmids. Reporter gene (luc) expression was confirmed in T-1 progeny from each of six tested independent transformants. Insufficient seeds were produced under containment conditions to determine segregation ratios. The practicality of the technique for efficient cotransformation with selected and unselected genes is demonstrated using major commercial peanut varieties in Australia (cv. NC-7, a virginia market type) and Indonesia (cv. Gajah, a spanish market type).

Is the Australian wool futures market efficient as a predictor of spot prices?

Giles and Goss (1980) have suggested that, if a futures market provides a forward pricing function, then it is an efficient market. In this article a simple test for whether the Australian Wool Futures market is efficient is proposed. The test is based on applying cointegration techniques to test the Law of One Price over a three, six, nine, and twelve month spread of futures prices. We found that the futures market is efficient for up to a six-month spread, but no further into the future. Because futures market prices can be used to predict spot prices up to six months in advance, woolgrowers can use the futures price to assess when they market their clip, but not for longer-term production planning decisions. (C) 1999 John Wiley & Sons, Inc.