A preemptive bound for the Resource Constrained Project Scheduling Problem

The Resource Constrained Project Scheduling Problem is one of the most intensively investigated scheduling problems. It requires scheduling a set of interrelated activities, while considering precedence relationships, and limited renewable resources allocation. The objective is to minimize the project duration. We propose a new destructive lower bound for this challenging ${\mathcal {NP}}$ -hard problem. Starting from a previously suggested LP model, we propose several original valid inequalities that aim at tightening the model representation. These new inequalities are based on precedence constraints, incompatible activity subsets, and nonpreemption constraints. We present the results of an extensive computational study that was carried out on 2,040 benchmark instances of PSPLIB, with up to 120 activities, and that provide strong evidence that the new proposed lower bound exhibits an excellent performance. In particular, we report the improvement of the best known lower bounds of 5 instances.     

Simulating protection rackets: a case study of the Sicilian Mafia

Protection racketeering groups are powerful, deeply entrenched in multiple societies across the globe, and they harm the societies and economies in which they operate in multiple ways. These reasons make their dynamics important to understand and an objective of both scientific and application-oriented interest. Legal and social norm-based approaches arguably play significant roles in influencing protection racket dynamics. We propose an agent-based simulation model, the Palermo Scenario, to enrich our understanding of these influences and to test the effect of different policies on protection racket dynamics. Our model integrates the legal and the social norm-based approaches and uses a complex normative agent architecture that enables the analysis of both agents’ behaviours and mental normative representations driving behaviour. We demonstrate the usefulness of the model and the benefits of using this complex normative architecture through a case study of the Sicilian Mafia.     

Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and fast. In this paper, we propose several new lower bounds that are based on the concept of energetic reasoning. A major contribution of this work is to investigate several enhanced new feasibility tests that prove useful for deriving new lower bounds that consistently outperform the classical energetic reasoning-based lower bound. In particular, we present the results of a comprehensive computational study, carried out on 1560 benchmark instances, that provides strong evidence that a deceptively simple dual feasible function-based lower bound is highly competitive with a state-of-the-art lower bound while being extremely fast. Furthermore, we found that an effective shaving procedure enables to derive an excellent lower bound that often outperforms the best bound from the literature while being significantly simpler.     

Complete structure of glycopeptides isolated from IgG immunoglobulins of cow colostrum

Bovine immunoglobulins (IgG1 type) have been isolated from colostral whey. Hydrolysis by pronase, trypsin and (or) chymotrypsin yield several glycopeptides structural studies of which lead to the following results. 1. IgG1 colostral immunoglobulins possess two glycan moieties which are linked to the peptidic chain by an N-(beta-aspartyl)-N-acetylglucosaminylamine bound. 2. The peptidic sequence around the linkage region has been determined by classical methods and is as follows: Thr-Lys-Pro-Arg-Glu-Glu-Gln-Phe-Asn(Glycan)-Ser-Thr-Tyr-Arg. 3. The following procedures: partial acidic hydrolysis, periodic oxidation, hydrazinolysis-nitrous deamination, methylation and use of specific glycosidases allowed us to determine the structure of the glycan moieties which fit with the general following scheme: (see article) Thus they could be related to the general glycan structure so-called of "N-acetyllactosamine type" because they possess the pentasaccharidic core common to numerous glycoproteins Man alpha 1 leads to [Man alpha 1 leads to 6] Man beta 1 leads to 4 GlcNAc beta 1 leads to 4 GlcNAc beta 1 leads to Asn on which are conjugated 2 N-acetyllactosamine residues. Besides they present a microheterogeneity which is due to the varying number of additional N-acetylneuraminic acid and fucose residues. 4. These structures are compared to various immunoglobulin structures proposed by others: bovine serum IgG and human serum IgG, IgE and IgA.     

Multiparametric analysis within the proper generalized decomposition framework

Optimization campaigns, which are being launched more and more often, require the execution of many parametric studies which can make the approach very costly in terms of computation time. Here, in order to reduce these computation times, we undertake to develop a multiparametric strategy using the LATIN method along with Proper Generalized Decomposition. This approach is compared to other common strategies, especially those based on POD.     

Time‐space PGD for the rapid solution of 3D nonlinear parametrized problems in the many‐query context

This work deals with the question of the resolution of nonlinear problems for many different configurations in order to build a ‘virtual chart’ of solutions. The targeted problems are three‐dimensional structures driven by Chaboche‐type elastic‐viscoplastic constitutive laws. In this context, parametric analysis can lead to highly expensive computations when using a direct treatment. As an alternative, we present a technique based on the use of the time‐space proper generalized decomposition in the framework of the LATIN method. To speed up the calculations in the parametrized context, we use the fact that at each iteration of the LATIN method, an approximation over the entire time‐space domain is available. Then, a global reduced‐order basis is generated, reused and eventually enriched, by treating, one‐by‐one, all the various parameter sets. The novelty of the current paper is to develop a strategy that uses the reduced‐order basis for any new set of parameters as an initialization for the iterative procedure. The reduced‐order basis, which has been built for a set of parameters, is reused to build a first approximation of the solution for another set of parameters. An error indicator allows adding new functions to the basis only if necessary. The gain of this strategy for studying the influence of material or loading variability reaches the order of 25 in the industrial examples that are presented. Copyright © 2015 John Wiley & Sons, Ltd.     

Crystallography of graphite spheroids in cast iron

To further understand graphite growth mechanisms in cast irons, this study focuses on the crystal structure of a graphite spheroid in the vicinity of its nucleus. A sample of a graphite spheroid from a commercial cast iron was characterised using transmission electron microscopy. The chemical composition of the nucleating particle was studied at the local scale. Crystal orientation maps of the graphite spheroid revealed misorientations and twist boundaries. High-resolution lattice fringe images showed that the basal planes of graphite were wavy and distorted close to the nucleus and very straight further away from it. These techniques were complementary and provided new insights on spheroidal graphite nucleation and growth.     

Single-phase and binary phase nanogranular ferrites for magnetic hyperthermia application

The study demonstrates the performance of heating efficiency in single-phase and binary phase spinel ferrite nanosystems. Ferrimagnetic cobalt ferrite (CoFe₂O₄) (CFO) and superparamagnetic copper ferrite/copper oxide (CuFe₂O₄/CuO) (CuF) nanosystems of different particle sizes were synthesized through a microwave-assisted coprecipitation method. The heating behavior was observed in range of both field amplitudes (8-24 kA/m at 516 kHz) and frequencies (325-973 kHz at 12 kA/m). The heating efficiency was analyzed and compared by means of particle size, magnetization, effective anisotropy constant, and Néel relaxation mechanism. Indeed, the heating rate was maximized in larger ferrite particles with low effective anisotropy constant. Moreover, though the magnetization and effective anisotropy constant of single-phase CoFe₂O₄ nanoparticles were higher, the binary phase CuFe₂O₄/CuO nanosystems of similar crystallite size (28 nm) exhibited superior heating efficiency (4.21°C/s). For a field amplitude and frequency of 24 kA/m and 516 kHz, the heating rate of CuF and CFO ferrites with different crystallite sizes decreased in the order of 4.21 > 2.14 > 0.58 > 0.52°C/s for 29 nm > 25 nm > 12 nm > 15 nm, respectively. The results emphasize that binary phase ferrite nanoparticles are better thermoseeds than the single-phase ferrites for the magnetic hyperthermia application.