Criticality Analysis of Activity Networks under Interval Uncertainty

Jérôme Fortin 1 Pawel Zielinski 2 Didier Dubois 3 Hélène Fargier 3
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : This paper reconsiders the Project Evaluation and Review Technique (PERT) scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formulation, our goal is to assert possible and necessary criticality of the different tasks and to compute their possible earliest starting dates, latest starting dates, and floats. This paper combines various results and provides a complete solution to the problem. We present the complexity results of all considered subproblems and efficient algorithms to solve them.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00551624
Contributor : Jérôme Fortin <>
Submitted on : Tuesday, January 4, 2011 - 11:13:33 AM
Last modification on : Thursday, October 24, 2019 - 2:44:06 PM
Long-term archiving on : Tuesday, April 5, 2011 - 2:50:43 AM

File

js1.pdf
Files produced by the author(s)

Identifiers

Citation

Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier. Criticality Analysis of Activity Networks under Interval Uncertainty. Journal of Scheduling, Springer Verlag, 2010, 13 (6), pp.609-627. ⟨10.1007/s10951-010-0163-3⟩. ⟨lirmm-00551624⟩

Share

Metrics

Record views

553

Files downloads

1562