Temporal Analysis of Projects Under Interval Uncertainty

Christian Artigues (), Cyril Briand () and Thierry Garaix ()
Additional contact information
Christian Artigues: Université de Toulouse
Cyril Briand: Université de Toulouse
Thierry Garaix: École Nationale Supérieure des Mines de Saint-Étienne

Chapter Chapter 41 in Handbook on Project Management and Scheduling Vol. 2, 2015, pp 911-927 from Springer

Abstract: Abstract Given an activity-on-node network where every activity has an uncertain duration represented by an interval, this chapter takes an interest in computing the minimum and maximum earliest start times, latest start times and floats of all activities over all duration scenarios. The basic results from the literature are recalled and efficient solving algorithms are detailed. A particular focus is put on the computation of minimum float, which remains an 𝒩 𝒫 $$\mathcal{N}\mathcal{P}$$ -hard optimization problem. For this last case, a recent and efficient branch and bound algorithm is described that outperforms previously proposed methods.

Keywords: Algorithms; Branch-and-bound; Complexity; Interval uncertainty; Project scheduling; Temporal analysis (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-319-05915-0_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319059150

DOI: 10.1007/978-3-319-05915-0_11

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().