Skip to Main content Skip to Navigation
Journal articles

Models and Algorithms for Robust PERT Scheduling with Time-Dependent Task Durations

Michel Minoux 1
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper investigates models and solution algorithms for solving PERT scheduling problems under uncertainty on task processing times. The proposed uncertainty model is very general in that it is capable of representing situations in which various distinct sources of uncertainty have to be considered ; and realistic in that it is consistent with the idea that situations featuring simultaneous occurrence of worst-case values for all (or a majority of) the task processing times do not have to be taken into account in the robustness analysis. From the computational point-of-view, a major interest of this uncertainty model is to provide very compact representations of potentially huge uncertainty sets, thus leading to efficient solution algorithms. We address both the standard case (where processing times do not depend on actual starting dates) and the case of time-dependent task durations.
Document type :
Journal articles
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 1, 2015 - 2:58:42 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM


  • HAL Id : hal-01170398, version 1


Michel Minoux. Models and Algorithms for Robust PERT Scheduling with Time-Dependent Task Durations. Vietnam Journal of Mathematics, Springer, 2007, 35 (4), pp.387-398. ⟨hal-01170398⟩



Record views