Skip to main content
Log in

Computational methods for determining the latest starting times and floats of tasks in interval-valued activity networks

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In project management, three quantities are often used by project managers: the earliest starting date, the latest starting date and the float of tasks. These quantities are computed by the Program Evaluation and Review Techniques/Critical Path Method (PERT/CPM) algorithm. When task durations are ill known, as is often the case at the beginning of a project, they can be modeled by means of intervals, representing the possible values of these task durations. With such a representation, the earliest starting dates, the latest starting dates and the floats are also intervals. The purpose of this paper is to give efficient algorithms for their computation. After recalling the classical PERT/CPM problem, we present several properties of the concerned quantities in the interval-valued case, showing that the standard criticality analysis collapses. We propose an efficient algorithm based on path enumeration to compute optimal intervals for latest starting times and floats in the general case, and a simpler polynomial algorithm in the case of series-parallel activity networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. W. Bein J. Kamburowski M. F. M. Stallmann (1992) ArticleTitleOptimal reductions of two-terminal directed acyclic graphs SIAM Journal of Computation 21 IssueID6 1112–1129 Occurrence Handle10.1137/0221065

    Article  Google Scholar 

  2. R. Bellman A. Esogbue I. Nabeshima (1982) Mathematical Aspects of Scheduling and Applications Pergamon Press Oxford, UK

    Google Scholar 

  3. J. Brige M. Dempster (1996) ArticleTitleStochastic programming approaches to stochastic scheduling Global Optimisation 9 383–409

    Google Scholar 

  4. Buckley, J. (1989) Fuzzy PERT in Applications of Fuzzy set Methodologies in Industrial Engineering, G. W. Evans, W. Karwowski and M. R. Wilhelm (eds), Elsevier, Amsterdam, pp. 103–114.

  5. S. Chanas D. Dubois P. Zielinski (2002) ArticleTitleOn the sure criticality of tasks in activity networks with imprecise durations IEEE Transactions on Systems, Man, and Cybernetics 34 393–407

    Google Scholar 

  6. S. Chanas J. Kamburowski (1981) ArticleTitleThe use of fuzzy variables in PERT Fuzzy Set and Systems 5 1–19 Occurrence Handle10.1016/0165-0114(81)90029-4

    Article  Google Scholar 

  7. S. Chanas P. Zielinski (2003) ArticleTitleOn the hardness of evaluating criticality of activities in planar network with duration intervals Operations Research Letters 31 53–59 Occurrence Handle10.1016/S0167-6377(02)00174-8 Occurrence HandleMR1946735

    Article  MathSciNet  Google Scholar 

  8. D. Dubois (1983) Modèles mathématiques de l’imprécis et de l’incertain en vue d’applications aux techniques d’aide à la décision Thèse d’État Université Scientifique et Médicale de Grenoble France

    Google Scholar 

  9. D. Dubois H. Fargier P. Fortemps (2003a) ArticleTitleFuzzy scheduling: modeling flexible constraints vs. coping with incomplete knowledge European Journal of Operational Research 147 231–252 Occurrence Handle10.1016/S0377-2217(02)00558-1 Occurrence HandleMR1966157

    Article  MathSciNet  Google Scholar 

  10. D. Dubois H. Fargier V. Galvagnon (2003) ArticleTitleOn latest starting times and floats in activity networks with ill-known durations European Journal of Operational Research 147 266–280 Occurrence Handle10.1016/S0377-2217(02)00560-X Occurrence HandleMR1966159

    Article  MathSciNet  Google Scholar 

  11. Dubois, D. and Prade, H. (1980) Fuzzy models for operations research. Fuzzy Sets and Systems, Theory and Applications, Academic Press, chapter III-4, pp. 242–251.

  12. D. Eppstein (1992) ArticleTitleParallel recognition of series-parallel graphs Information and Computation 98 41–55 Occurrence Handle10.1016/0890-5401(92)90041-D

    Article  Google Scholar 

  13. R. Kolisch A. Sprecher (1996) ArticleTitlePsplib – a project scheduling library European Journal of Operational Research 96 205–216 Occurrence Handle10.1016/S0377-2217(96)00170-1

    Article  Google Scholar 

  14. R. Kolisch A. Sprecher A. Drexl (1995) ArticleTitleCharacterization and generation of a general class of resource-constrained project scheduling problems Management Science 41 1693–1703

    Google Scholar 

  15. F. Loostma (1989) ArticleTitleStochastic and fuzzy PERT European Journal of Operational Research 43 174–183 Occurrence Handle10.1016/0377-2217(89)90211-7

    Article  Google Scholar 

  16. F. Loostma (1997) Fuzzy Logic for Planning and Decision-Making Kluwer Academic Publisher Dordrecht

    Google Scholar 

  17. H. Prade (1979) ArticleTitleUsing fuzzy set theory in a scheduling problem: a case study Fuzzy Sets and Systems 2 153–165 Occurrence Handle10.1016/0165-0114(79)90022-8

    Article  Google Scholar 

  18. P. Zielinski (2005) ArticleTitleOn computing latest starting times and floats of activities in networks with imprecise durations Fuzzy Sets and Systems 150 53–76 Occurrence Handle10.1016/j.fss.2004.08.007

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dubois, D., Fargier, H. & Fortin, J. Computational methods for determining the latest starting times and floats of tasks in interval-valued activity networks. J Intell Manuf 16, 407–421 (2005). https://doi.org/10.1007/s10845-005-1654-5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-005-1654-5

Keywords

Navigation