Special Feature of Precedence Network Charts.
| dc.contributor.author | Harhalakis, George | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:44:05Z | |
| dc.date.available | 2007-05-23T09:44:05Z | |
| dc.date.issued | 1989 | en_US |
| dc.description.abstract | A recurring problem in precedence project planning networks is the time analysis of hammock activities. It is common practice in network logic drawings to 'bridge' some points with hammock activities as a flexible means to accommodate work of unknown duration, at least during the initial planning stage. In the past, hammocks were accounted for in such a way that, on some occasions, they consumed the float of preceding or succeeding activities unnecessarily. Thus, depending on their location within the network, erroneous, results could be generated. The time analysis of hammocks has never been based on a set of solid rules justifying the algorithmic determination of their start and finish times. This paper proposes an algorithm that only makes hammock activities comply with the 'behavior' of the path they belong to, leaving the rest of the network timing and resulting barcharts unaffect' by them. The proposed method has also been implemented in a computer application that treats hammock activities consistently with the timing of the entire project. Finally, some examples of hammocks placed in various locations of network charts are presented. | en_US |
| dc.format.extent | 693313 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4911 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1989-72 | en_US |
| dc.title | Special Feature of Precedence Network Charts. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1