Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...

We examine a situation in which a decision-maker executes a sequence of resource allocation decisions over time, but the availability of the indivisible resources at future epochs is uncertain due to actions of competitors. We cast this problem as a specialized type of stochastic knapsack problem in which the uncertainty of item (resource) availability is induced by competitors concurrently fil...

The problem of optimal policy formulation for teams of resourcelimited agents in stochastic environments is composed of two strongly coupled subproblems: a resource allocation problem and a policy optimization problem, both of which have individually received significant amount of attention. We show how to combine the two problems into a single constrained optimization problem that yields optim...

We consider a classic scheduling problem for optimally allocating a resource to multiple competing users and place it in the framework of Stochastic Flow Models (SFMs). We derive Infinitesimal Perturbation Analysis (IPA) gradient estimators for the average holding cost with respect to resource allocation parameters. These estimators are easily obtained from a sample path of the system without a...

Water pollution has become one of the most serious issues threatening water environments, as a resource and human health. The urgent effective measures rely on dynamic accurate quality monitoring large scale. Due to their temporal spatial advantages, remote sensing technologies have been widely used retrieve data. With development hyper-spectral sensors, unmanned aerial vehicles (UAV) artificia...

in this research, both resource allocation and reactive resource allocation problems in multi-server dynamic pert networks are analytically modeled, where new projects are expected to arrive according to a poisson process, and activity durations are also known as independent random variables with exponential distributions. such system is represented as a queuing network, where multi servers at ...

Heterogeneous, parallel and distributed computing systems frequently must operate in environments where uncertainty in system parameters is common. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assumed. In such an environment, the amount of processing required to complete any given task may fluctuate sub...

New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for solving this problem, which make a number of a-priori sequencing decisions in a pre-processing phase while the rema...

This article examines the complexity of resource-allocation decisions for resource-constrained project scheduling. The allocation decisions are modeled by means of precedence networks and are closely related to ES-policies, which are a type of scheduling policies introduced for stochastic scheduling. We find that even a number of ‘surrogate’ objective functions, whose use has recently been prop...

We present a replication control protocol that provides excellent data availabilities while guaranteeing that all writes to the object are recorded in at least two replicas. The protocol, robust dynamic voting (RDV) accepts reads and writes as long as at least two replicas remain available. The replicated object remains inaccessible until either the two last available replicas recover or one of...