This paper presents a software pipelining algorithm for the automatic extraction of ne-grain parallelism in general loops. The algorithm accounts for machine resource constraints in a way that smoothly integrates the management of resource constraints with software pipelining. Furthermore, generality in the software pipelining algorithm is not sacriiced to handle resource constraints, and sched...

We study concurrent processes modelled as workflow Petri nets extended with resource constrains. We define structural criteria for the correctness of such models based on traps and siphons. We also define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is...

The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theoretical and experimental results for CSP. In the theoretical part we present the hull approach, a combinatorial algorithm for solving a linear programming relaxation and prove that it runs in polynomial time in the case...

during the implementation, construction projects usually encounter situation that considerably affects the project scheduling and cost. this study aims at using an improved version of the harmony search algorithm (hsa) to schedule resource constrained construction projects. this model is formulated as a global optimization problem. it will determine the duration of each activity to minimize the...

in this paper, a fully informed particle swarm (fips) algorithm is proposed for solving the multi-mode resource-constrained project scheduling problem (mrcpsp) with minimization of project makespan as the objective subject to resource and precedence constraints. in the proposed fips, a random key and the related mode list (ml) representation scheme are used as encoding schemes and the multi-mod...

Recently, Opportunistic Networks (OppNets) are considered to be one of the most attractive developments Mobile Ad Hoc that have arisen thanks development intelligent devices. OppNets characterized by a rough and dynamic topology as well unpredictable contacts contact times. Data is forwarded stored in intermediate nodes until next opportunity occurs. Therefore, achieving high delivery ratio cha...

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...