Skip to main content
Log in

Criticality Analysis in Activity-on-Node Networks with Minimal Time Lags

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper is a systematic study of the critical nature of activities and relationships in AON networks with minimal time lags in the unlimited resource case, when activity splitting is not allowed. An analysis of all possible cases produces an extended and now complete classification of critical activities in six classes: normal, reverse, neutral, bicritical, increasing normal and decreasing reverse. We also present a procedure for classifying any critical task depending on the early start/finish times and on position within the critical paths.

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.

Similar content being viewed by others

References

  1. M. Bartusch, R.H. Möhring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Annals of Operations Research 16 (1988) 201–240.

    Google Scholar 

  2. K.C. Crandall, Project planning with precedence lead/lag factors, Project Management Quarterly 4 (1973) 18–27.

    Google Scholar 

  3. B. De Reyck and W. Herroelen, A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations, European Journal of Operational Research 111 (1998) 152–174.

    Google Scholar 

  4. S.E. Elmaghraby and J. Kamburowski, The analysis of activity networks under generalized precedence relations (GPRs), Management Science 38(9) (1992) 1245–1263.

    Google Scholar 

  5. M. Hajdu, Network Scheduling Techniques for Construction Project Management (Kluwer Academic, 1997).

  6. W. Herroelen, B. De Reyck and E. Demeulemeester, Resource-constrained project scheduling: A survey of recent developments, Comput. Oper. Res. 25(4) (1998) 279–302.

    Google Scholar 

  7. J.J. Moder and K.C. Crandall, Precedence diagramming: Time computations, anomalies and remedies, Project Management: Methods and Studies (1985) 95-110.

  8. J.J. Moder, C.R. Phillips and E.W. Davis, Project Management with CPM, PERT and Precedence Diagramming (Van Nostrand-Reinhold, 1983).

  9. K. Neumann and J. Zhan, Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints, Journal of Intelligent Manufacturing 6 (1995) 145–154.

    Google Scholar 

  10. J.D. Wiest, Precedence diagramming method: Some unusual characteristics and their implications for project managers, Journal of Operations Management 1 (1981) 121–130.

    Google Scholar 

  11. J.D. Wiest and F.K. Levy, A Management Guide to PERT/CPM with GERT/PDM/DCPM and other Networks (Prentice-Hall, 1977).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Valls, V., Lino, P. Criticality Analysis in Activity-on-Node Networks with Minimal Time Lags. Annals of Operations Research 102, 17–37 (2001). https://doi.org/10.1023/A:1010941729204

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010941729204

Navigation