Issue: 2003/Vol.13/No.4, Pages 185-208
COMPUTING EFFICIENTLY FLOATS OF ALL ACTIVITIES IN A SERIES-PARALLEL NETWORK WITH DURATION INTERVALS
Paweł Zieliński
Cite as: P. Zieliński. Computing efficiently floats of all activities in a series-parallel network with duration intervals. Operations Research and Decisions 2003: 13(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
Received: Accepted: