ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

Altruism, Equity, and Reciprocity in a Gift-Exchange Experiment: An Encompassing Approach

Considerable experimental evidence suggests that non-pecuniary motives must be addressed when modeling behavior in economic contexts. Recent models of non-pecuniary motives can be classified as either altruism- based, equity-based, or reciprocity-based. We estimate and compare leading approaches in these categories, using experimental data. We then offer a flexible approach that nests the above three approaches, thereby allowing for nested hypothesis testing and for determining the relative strength of each of the competing theories. In addition, the encompassing approach provides a functional form for utility in different settings without the restrictive nature of the approaches nested within it. Using this flexible form for nested tests, we find that intentional reciprocity, distributive concerns, and altruistic considerations all play a significant role in players' decisions.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Biological markers of alcohol consumption in alcoholised drivers: Comparison of capillary electrophoresis (CZE CDT) and a direct immunoassay (N Latex CDT) with the traditional method of anion-exchange chromatography-immunoturbidimetry (%CDT TIA).

Objectives: The aim of this study was to compare specificity and sensitivity of different biological markers that can be used in a forensic field to identify potentially dangerous drivers because of their alcohol habits. Methods: We studied 280 Swiss drivers after driving while under the alcohol influence. 33 were excluded for not having CDT N results, 247 were included (218 men (88%) and 29 women (12%). Mean age was 42,4 (SD:12, min: 20 max: 76). The evaluation of the alcohol consumption concerned the month before the CDT test and was considered as such after the interview: Heavy drinkers (>3 drinks per day): 60 (32.7%), < 3 drinks per day and moderate: 127 (51.4%) 114 (46.5%), abstinent: 60 (24.3%) 51 (21%). Alcohol intake was monitored by structured interviews, self-reported drinking habits and the C-Audit questionnaire as well as information provided by their family and general practitioner. Consumption was quantified in terms of standard drinks, which contain approximately 10 grams of pure alcohol (Ref. WHO). Results: comparison between moderate (less or equal to 3 drinks per day) and excessive drinkers (more than 3 drinks) Marker ROC area 95% CI cut-off sensitivity specificity CDT TIA 0.852 0.786-0917 2.6* 0.93 LR+1.43 0.35 LR-0.192 CDT N latex 0.875 0.821-0.930 2.5* 0.66 LR+ 6.93 0.90 LR- 0.369 Asialo+disialo-tf 0.881 0.826-0.936 1.2* 0.78 LR+4.07 0.80 LR-0.268 1.7° 0.66 LR+8.9 0.93 LR-0.360 GGT 0.659 0.580-0.737 85* 0.37 LR+2.14 0.83 LR-0.764 * cut-off point suggested by the manufacturer ° cut-off point suggested by our laboratory Conclusion: With the cut-off point established by the manufacturer, CDT TIA performed poorly in term of specificity. N latex CDT and CZE CDT were better, especially if a 1.7 cut-off is used with CZE

Bands width, credibility and exchange risk: Lessons from the EMS experience

This paper presents an analysis of the credibility of the EMScurrencies that covers the period before and after the increase in thebands of fluctuation. Our credibility indicator is based on the inferredprobabilities derived from the estimation of a Markov-switching model(Hamilton (1989)) applied to the expected rate of depreciation. Theresults show that, for most of the currencies, credibility has improved,at least transitorily, after the increase in the bands. However, for allcurrencies, the credibility measured by the indicator proposed in thispaper has been eroded recently even with the widened bands.

Consistent solutions in exchange economies: A characterization of the price mechanism

We characterize the Walrasian allocations correspondence by means offour axioms: consistency, replica invariance, individual rationality andPareto optimality. It is shown that for any given class of exchange economiesany solution that satisfies the axioms is a selection from the Walrasianallocations with slack. Preferences are assumed to be smooth, but may besatiated and non--convex. A class of economies is defined as all economieswhose agents' preferences belong to an arbitrary family (finite or infinite)of types. The result can be modified to characterize equal budget Walrasianallocations with slack by replacing individual rationality with individualrationality from equal division. The results are valid also for classes ofeconomies in which core--Walras equivalence does not hold.

On money as a medium of exchange when goods vary by supply and demand

Models of the exchange process based on search theory can be usedto analyze the features of objects that make them more or less likely toemerge as ``money'' in equilibrium. These models illustrate the trade--offbetween endogenous acceptability (an equilibrium property) and intrinsiccharacteristics of goods, such as storability, recognizability, etc. Inthis paper, we look at how the relative supply and demand for various goodsaffect their likelihood of becoming money. Intuitively, goods in highdemand and/or low supply are more likely to appear as commodity money,subject to the qualification that which object ends up circulating as amedium of exchange depends at least partly on convention. Welfare propertiesare discussed.

RecA-mediated strand exchange traverses substitutional heterologies more easily than deletions or insertions.

RecA protein in bacteria and its eukaryotic homolog Rad51 protein are responsible for initiation of strand exchange between homologous DNA molecules. This process is crucial for homologous recombination, the repair of certain types of DNA damage and for the reinitiation of DNA replication on collapsed replication forks. We show here, using two different types of in vitro assays, that in the absence of ATP hydrolysis RecA-mediated strand exchange traverses small substitutional heterologies between the interacting DNAs, whereas small deletions or insertions block the ongoing strand exchange. We discuss evolutionary implications of RecA selectivity against insertions and deletions and propose a molecular mechanism by which RecA can exert this selectivity.