The role of the nonanticipativity constraint in commercial software for stochastic project scheduling

Fernandez, Abel A.; Armacost, Robert L.; Pet-Edwards, Julia

doi:10.1016/0360-8352(96)00119-2

Cited by 24 publications

(9 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The expected project duration of a feasible solution is computed as follows: (a) a duration for each activity is drawn from the beta distribution with the parameters calculated using the three time estimates, (b) given the feasible sequence and the randomly generated activity durations, the project duration is computed, (c) the calculation of the project duration is repeated 100 times and then the average project duration for the particular feasible sequence is reported as the expected project duration. It should be noted that this approach to estimate the expected project duration violates the so-called non-anticipativity constraint (Fernandez et a!., 1996). The approach implicitly assumes that all uncertainty with regard to activity durations is resolved before the start of project execution ('anticipative'), which will only rarely be the case.…”

Section: Heuristic Proceduresmentioning

confidence: 99%

“…The common objective considered in the literature is to create a policy that minimizes the expected project duration E(Cmax (IT(d») over a class of policies. Fernandez (1995), Fernandez et al (1996) and Pet-Edwards et al (1998) show how to write the corresponding optimisation problem in its general form as a multi-stage stochastic programming problem.…”

Section: Stochastic Resource-constrained Project Schedulingmentioning

confidence: 99%

“…Research on heuristic procedures for solving the stochastic RCPSP is just emerging (Pet-Edwards (1996), Golenko-Ginsburg and Gonik (1997), Gemmill (1996,1998)). As an illustration, we briefly discuss the procedures ofGolenko-Ginsburg and Gonik (1997) and the tabu search procedure ofTsai and Gemmill (1998).…”

Section: Heuristic Proceduresmentioning

confidence: 99%

See 2 more Smart Citations

Project scheduling under uncertainty: Survey and research potentials

Herroelen

Leus

2005

European Journal of Operational Research

753

387

View full text Add to dashboard Cite

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, that is gradually resolved during project execution. In this survey we review the fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, stochastic GERT network scheduling; fuzzy project scheduling, robust (proactive) scheduling and sensitivity analysis. We discuss the potentials of these approaches for scheduling projects under uncertainty.

show abstract

Section: Heuristic Proceduresmentioning

confidence: 99%

Section: Stochastic Resource-constrained Project Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Project scheduling under uncertainty: Survey and research potentials

Herroelen

Leus

2005

European Journal of Operational Research

753

387

View full text Add to dashboard Cite

show abstract

“…The common objective considered in the literature is to create a policy that minimizes the expected project duration over a class of policies (Igelmund and Radermacher 1983a, b). Fernandez (1995), Fernandez et al (1996) and Pet-Edwards et al (1998) show how to write the corresponding optimization problem in its general form as a multi-stage stochastic programming problem. A comprehensive characterization of policies can be found in Mo¨hring et al (1984Mo¨hring et al ( , 1985 and Stork (2001).…”

Section: Dynamic Scheduling Using Scheduling Policiesmentioning

confidence: 99%

Robust and reactive project scheduling: a review and classification of procedures

Herroelen

Leus

2004

International Journal of Production Research

229

103

View full text Add to dashboard Cite

The vast majority of the research efforts in project scheduling over the past several years has concentrated on the development of exact and suboptimal procedures for the generation of a baseline schedule assuming complete information and a deterministic environment. During execution, however, projects may be the subject of considerable uncertainty, which may lead to numerous schedule disruptions. Predictive-reactive scheduling refers to the process where a baseline schedule is developed prior to the start of the project and updated if necessary during project execution. It is the objective of this paper to review possible procedures for the generation of proactive (robust) schedules, which are as well as possible protected against schedule disruptions, and for the deployment of reactive scheduling procedures that may be used to revise or re-optimize the baseline schedule when unexpected events occur. We also offer a framework that should allow project management to identify the proper scheduling methodology for different project scheduling environments. Finally, we survey the basics of critical chain scheduling and indicate in which environments it is useful.

show abstract

“…These methods define starting times for the activities by using scheduling policies based on a-priori knowledge, possibly based on experience from the past, about processing-time distributions [12,34,38]. Scheduling policies gradually build a schedule during the project's implementation and do not construct a complete schedule before project initiation; for this reason, these approaches are sometimes also referred to as purely reactive or on-line procedures.…”

Section: Introductionmentioning

confidence: 99%

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

2008

View full text Add to dashboard Cite

We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically during project execution. The pre-processing decisions entail the addition of precedence constraints to the scheduling instance, hereby resolving some potential resource conflicts. We compare the performance of this new class with existing scheduling policies for the stochastic resource-constrained project scheduling problem, and we observe that the new class is significantly better when the variability in the activity durations is medium to high.

show abstract

The role of the nonanticipativity constraint in commercial software for stochastic project scheduling

Cited by 24 publications

References 2 publications

Project scheduling under uncertainty: Survey and research potentials

Project scheduling under uncertainty: Survey and research potentials

Robust and reactive project scheduling: a review and classification of procedures

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

Contact Info

Product

Resources

About