Managing technology risk in R&D project planning: Optimal timing and parallelization of R&D activities.

An inherent characteristic of R&D projects is technological uncertainty, which may result in project failure, and time and resources spent without any tangible return. In pharmaceutical projects, for instance, stringent scientific procedures have to be followed to ensure patient safety and drug efficacy in pre-clinical and clinical tests before a medicine can be approved for production. A project consists of several stages, and may have to be terminated in any of these stages, with typically a low likelihood of success. In project planning and scheduling, this technological uncertainty has typically been ignored, and project plans are developed only for scenarios in which the project succeeds. In this paper, we examine how to schedule projects in order to maximize their expected net present value, when the project activities have a probability of failure, and where an activity's failure leads to overall project termination. We formulate the problem, show that it is NP-hard and develop a branchand- bound algorithm that allows to obtain optimal solutions. We also present polynomial-time algorithms for special cases, and present a number of managerial insights for R&D project and planning, including the advantages and disadvantages of parallelization of R&D activities in different settings.Applications; Branch-and-bound; Computational complexity; Exact algorithms programming; Integer; Pharmaceutical; Project management; Project scheduling; R&D projects analysis of algorithms; Risk industries;

Magnetic structures of RbCuCl_3 in a transverse field

A recent high-field magnetization experiment found a phase transition of unknown character in the layered, frustrated antiferromagnet RbCuCl_3, in a transverse field (in the layers). Motivated by these results, we have examined the magnetic structures predicted by a model of RbCuCl_3, using the classical approximation. At small fields, we obtain the structure already known to be optimal, an incommensurate (IC) spiral with wave vector q in the layers. At higher fields, we find a staircase of long-period commensurate (C) phases (separated initially by the low-field IC phase), then two narrow IC phases, then a fourth IC phase (also with intermediate C phases), and finally the ferromagnetically aligned phase at the saturation field H_S. The three-sublattice C states familiar from the theory of the triangular antiferromagnet are never optimal. The C phases and the two intermediate IC phases were previously unknown in this context. The magnetization is discontinuous at a field \approx 0.4H_S, in qualitative agreement with experiment, though we find much fine structure not reported.Comment: 9 pages, 8 figure

Initial Solution Heuristic for Portfolio Optimization of Electricity Markets Participation

Meta-heuristic search methods are used to find near optimal global solutions for difficult optimization problems. These meta-heuristic processes usually require some kind of knowledge to overcome the local optimum locations. One way to achieve diversification is to start the search procedure from a solution already obtained through another method. Since this solution is already validated the algorithm will converge easily to a greater global solution. In this work, several well-known meta-heuristics are used to solve the problem of electricity markets participation portfolio optimization. Their search performance is compared to the performance of a proposed hybrid method (ad-hoc heuristic to generate the initial solution, which is combined with the search method). The addressed problem is the portfolio optimization for energy markets participation, where there are different markets where it is possible to negotiate. In this way the result will be the optimal allocation of electricity in the different markets in order to obtain the maximum return quantified through the objective function.This work has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 641794 (project DREAM-GO) and from FEDER Funds through COMPETE program and from National Funds through FCT under the project UID/EEA/00760/2013.info:eu-repo/semantics/publishedVersio

Error bounds for monomial convexification in polynomial optimization

Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global optimum from such approaches. We give bounds on the worst-case error for convexifying a monomial over subsets of $[0,1]^n$. This implies additive error bounds for relaxing a polynomial optimization problem by convexifying each monomial separately. Our main error bounds depend primarily on the degree of the monomial, making them easy to compute. Since monomial convexification studies depend on the bounds on the associated variables, in the second part, we conduct an error analysis for a multilinear monomial over two different types of box constraints. As part of this analysis, we also derive the convex hull of a multilinear monomial over $[-1,1]^n$.Comment: 33 pages, 2 figures, to appear in journa

Ternary erbium chromium sulfides : structural relationships and magnetic properties

Single crystals of four erbium-chromium sulfides have been grown by chemical vapor transport using iodine as the transporting agent. Single-crystal X-ray diffraction reveals that in Er(3)CrS(6) octahedral sites are occupied exclusively by Cr(3+) cations, leading to one-dimensional CrS(4)(5-) chains of edge-sharing octahedra, while in Er(2)CrS(4), Er(3+), and Cr(2+) cations occupy the available octahedral sites in an ordered manner. By contrast, in Er(6)Cr(2)S(11) and Er(4)CrS(7), Er(3+) and Cr(2+) ions are disordered over the octahedral sites. In Er(2)CrS(4), Er(6)Cr(2)S(11), and Er(4)CrS(7), the network of octahedra generates an anionic framework constructed from M(2)S(5) slabs of varying thickness, linked by one-dimensional octahedral chains. This suggests that these three phases belong to a series in which the anionic framework may be described by the general formula [M(2n+1)S(4n+3)](x-), with charge balancing provided by Er(3+) cations located in sites of high-coordination number within one-dimensional channels defined by the framework. Er(4)CrS(7), Er(6)Cr(2)S(11), and Er(2)CrS(4) may thus be considered as the n = 1, 2, and infinity members of this series. While Er(4)CrS(7) is paramagnetic, successive magnetic transitions associated with ordering of the chromium and erbium sub-lattices are observed on cooling Er(3)CrS(6) (T(C)(Cr) = 30 K; T(C)(Er) = 11 K) and Er(2)CrS(4) (T(N)(Cr) = 42 K, T(N)(Er) = 10 K) whereas Er(6)Cr(2)S(11) exhibits ordering of the chromium sub-lattice only (T(N) = 11.4 K)

Local search heuristics for the multidimensional assignment problem

The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s also have a large number of applications. We consider several known neighborhoods, generalize them and propose some new ones. The heuristics are evaluated both theoretically and experimentally and dominating algorithms are selected. We also demonstrate that a combination of two neighborhoods may yield a heuristics which is superior to both of its components

Scanning probe microscopes go video rate and beyond

Quantum Matter and Optic

Boolean dynamics revisited through feedback interconnections

Boolean models of physical or biological systems describe the global dynamics of the system and their attractors typically represent asymptotic behaviors. In the case of large networks composed of several modules, it may be difficult to identify all the attractors. To explore Boolean dynamics from a novel viewpoint, we will analyse the dynamics emerging from the composition of two known Boolean modules. The state transition graphs and attractors for each of the modules can be combined to construct a new asymptotic graph which will (1) provide a reliable method for attractor computation with partial information; (2) illustrate the differences in dynamical behavior induced by the updating strategy (asynchronous, synchronous, or mixed); and (3) show the inherited organization/structure of the original network’s state transition graph.publishe

Initial Solution Heuristic for Portfolio Optimization of Electricity Markets Participation

Meta-heuristic search methods are used to find near optimal global solutions for difficult optimization problems. These meta-heuristic processes usually require some kind of knowledge to overcome the local optimum locations. One way to achieve diversification is to start the search procedure from a solution already obtained through another method. Since this solution is already validated the algorithm will converge easily to a greater global solution. In this work, several well-known meta-heuristics are used to solve the problem of electricity markets participation portfolio optimization. Their search performance is compared to the performance of a proposed hybrid method (ad-hoc heuristic to generate the initial solution, which is combined with the search method). The addressed problem is the portfolio optimization for energy markets participation, where there are different markets where it is possible to negotiate. In this way the result will be the optimal allocation of electricity in the different markets in order to obtain the maximum return quantified through the objective function.This work has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 641794 (project DREAM-GO) and from FEDER Funds through COMPETE program and from National Funds through FCT under the project UID/EEA/00760/2013.info:eu-repo/semantics/publishedVersio