Efficient computation of project characteristics in a series-parallel activity network with interval durations
- 538 Downloads
The paper deals with the problems of computing the completion time of a project, floats and the earliest and the latest starting times of activities, and of evaluating criticality of activities in a network with uncertain durations specified as intervals. We show efficient methods for determining these project characteristics in the network having a series-parallel topology.
KeywordsCompletion Time Decomposition Tree Path Tree Dynamic Tree Project Characteristic
Unable to display preview. Download preview PDF.
- J.J. Buckley. Fuzzy PERT. In G.W. Evans, W. Karwowski and M.R. Wilhelm, editors, Applications of Fuzzy Set Methodologies in Industrial Engineering. Elsevier, Amsterdam-Oxford-New York-Tokyo, 1989, 103–114.Google Scholar
- H. Fargier, V. Galvagnon and D. Dubois. Fuzzy PERT in series-parallel graphs. In 9-th IEEE Int. Conf on Fuzzy Systems, San Antonio, TX, pages 717–722, 2000.Google Scholar
- J. Fortin, P. Zieliński, D. Dubois and H. Fargier. Interval analysis in scheduling. In P. van Beek (Ed.), Principles and Practice of Constraint Programming — CP 2005. LNCS vol. 3709, 2005.Google Scholar
- J.E. Kelley and M.R. Walker. Critical path planning and and Scheduling. In Proceedings of the Eastern Joint Computational Conference pages 160–172, 1959.Google Scholar
- F.A. Loostma. Fuzzy Logic for Planning and Decision-Making. Dordrecht Kluwer Acad. Publ., 1997.Google Scholar