The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. an integer programming model is formulated for the project portfolio selection and scheduling.two heuristic algorithms, genetic algorithm (ga) and simulated annealing (sa), are presented to solve the problem. results of cal...

Genetic algorithm is one of the main heuristics that have been applied to scheduling problems in the last few decades. This paper presents a generalization of the genetic algorithm for solving project scheduling problem under time uncertainties within resource leveling technique. The generalization consists of handling fuzzy time parameter and fuzzy resource distribution instead of crisp ones. ...

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...

In a fuzzy project network, the higher risk path is called possible critical path. Secondary critical path is one of the possible critical path in fuzzy project network and it plays an important role in the project scheduling, risk analysis and time-cost trade-off problems in fuzzy environment. In this paper, triangular fuzzy numbers are used to express the operation times for all activities in...

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the real world, project activities are subject to considerable uncertainty, which is gradually resolved during project execution. In this survey w...

Critical Path method (CPM) is widely used in project scheduling and controlling. In conventional project scheduling problem, the crisp numbers are used for the activity times. But in reality, in an imprecise and uncertain environment, it is an unrealistic assumption. To represent the uncertainty involved we have considered the interval-valued numbers to represent the activity times. In this pap...