Stochastic network project scheduling with non-consumable limited resources

Sounds of Silence: a sampling-based bi-criteria harmony search metaheuristic for the resource constrained project scheduling problem with uncertain activity durations and cash flows

“…In highly uncertain and usually very long range, a more sophisticated forecasting method (a possibilistic or probabilistic approach with several estimated parameters and special operators) is not necessarily a crystal ball in the imagination of the future. In order to illustrate the efficiency and stability of the proposed SoS metaheuristic we presented detailed computational results for a larger and challenging project instance borrowed from Golenko-Ginzburg and Gonik [17] and discussed by several authors in the literature.…”

“…At the running of the resource-constrained project borrowed from GolenkoGinzburg and Gonik [17] we changed the default optimality tolerance parameters (Relative Gap = 0.01 % and Absolute Gap = 5 period) and the Time Limit parameter (10 hours). In the presented example, the { WA, W B} = { 1, 1} weight set was used.…”

“…In this section, as a motivating example, we consider a larger resource constrained project with 36 real activities borrowed from Golenko-Ginzburg and Gonik [17]. In contrast to the instances of the well-known and popular PSPLIB developed by Kolisch and Sprecher [18], this instance already includes information of random activity durations that is, for each activity i the optimistic and pessimistic duration time [A i , B i ], i ∈ { 1, 2, ... , 36} is given.…”

Resource-Constrained Project Scheduling for Timely Project Completion with Stochastic Activity Durations

“…Research into SRCPSP, however, has remained limited to date, with few computational publications addressing this problem: Igelmund and Radermacher (1983) and Stork (2001) report on experiments with branch-and-bound algorithms, while Golenko-Ginzburg and Gonik (1997) and Tsai and Gemmill (1998) develop greedy and local-search heuristics.…”

A Novel Class of Scheduling Policies for the Stochastic Resource-Constrained Project Scheduling Problem

“…The difference between PPGA and ABGR is small, which might be due to fact that the solutions in both procedures are near optimal. Golenko-Ginzburg and Gonik [15] test their procedures on only one instance, which has 36 activities and a single renewable resource type. The authors introduce two approaches, one based on an exact procedure to solve consecutive multi-dimensional knapsack problems (Heuristic 1) and one that resorts to heuristic solution of those knapsack problems (Heuristic 2).…”