Computing efficiently floats of all activities in a series-parallel network with duration intervals

Paweł Zieliński ()

Operations Research and Decisions, 2003, vol. 13, issue 4, 185-208

Abstract: The paper deals with the problem of computing intervals of possible values of floats for all activities in a series-parallel network with duration intervals. An O (n) time algorithm, using graph reductions, for computing the interval of possible values of floats for a single activity and an algorithm for computing the intervals for all activities in the network that runs O (n log n) time and requires a linear space for a data structure are presented.

Keywords: fuzzy portfolio selection; linear programming; interval coefficient; fuzzy coefficient (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/2003416%20-%20published.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:4:y:2003:p:15

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().