| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 477133 | European Journal of Operational Research | 2010 | 7 Pages |
Abstract
This paper deals with problems of determining possible values of earliest and latest starting times of an activity in networks with minimal time lags and imprecise durations that are represented by means of interval or fuzzy numbers. Although minimal time lags are practical in different projects, former researchers have not considered these problems.After proposing propositions which reduce the search space, a novel polynomial algorithm is presented to compute intervals of possible values of latest starting times in interval-valued networks with minimal time lags. Then, the results are extended to networks with fuzzy durations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Siamak Haji Yakhchali, Seyed Hassan Ghodsypour,