An Application of Reliability-analysis Techniques in Project Management
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 6
Abstract
This paper handles a prominent problem of project management, namely that of project scheduling under uncertainty. The paper models this problem as a vector-weighted voting system and expresses the indicator variable for the successful (on-time) completion of project activities as a vector-threshold Boolean function. The paper presents a solution of the problem in the Boolean domain using solely Boolean tools. The paper also presents another solution of the problem via recursive relations and boundary conditions. This solution is given as an insightful visual representation in terms of a signal-flow graph that resembles the Reduced-Ordered Binary Decision Diagram (ROBDD). The effect of the order of variables used in the recursive method is also explored.
Authors and Affiliations
Ali Muhammad Ali Rushdi, Alaa Mohammad Alturki
A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations
Any system of ‘big’ Boolean equations can be reduced to a single Boolean equation {g(Z)=1}. We propose a novel method for producing a general parametric solution for such a Boolean equation without attempting to minimize...
Recurrent Neural Network Based Modeling of Gene Regulatory Network Using Bat Algorithm
Correct inference of genetic regulations inside a cell is one of the greatest challenges in post genomic era for the biologist and researchers. Several intelligent techniques and models were already proposed to identify...
Fixed Points for Some Multivalued Mappings in Gp- Metric Spaces
The aim of this work is to establish some new xed point theorems for multivalued mappings in Gp metric space.
The Riemann Zeta Function and Its Analytic Continuation
The objective of this dissertation is to study the Riemann zeta function in particular it will examine its analytic continuation, functional equation and applications. We will begin with some historical background, then...
Achieving System Reliability with the Fewest Identical Components
enerally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.