Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/8530
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vishwanath, G. | - |
dc.date.accessioned | 2014-11-14T10:22:01Z | - |
dc.date.available | 2014-11-14T10:22:01Z | - |
dc.date.issued | 1975 | - |
dc.identifier | M.Tech | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/8530 | - |
dc.guide | Puri, N. | - |
dc.description.abstract | The relevance of a systems approach to construction management is pointed out. Network techniques* as a tool in systems analysis, have been mentioned and the acyclic, directed, non stochastic network (the CPM network) has been discussed in detaile The mathematical model of the scheduling phase of CPM has been presented and followed by a lucid.descrip Lion of a computer program for the scheduling computations. The importance of the problem of Res ource bevelling has been discussed and followed by a survey of the work. already done in this field. An original algorithm for the Resource scheduling problem has been presented, followed by a detailed description of the computer program. To illustrate the two computer programs, the hutment renovation project currently in progress at the University, has been taken as a case study, and the results of the CPM Scheduling program and the Resource levelling program have been reported. | en_US |
dc.language.iso | en | en_US |
dc.subject | CIVIL ENGINEERING | en_US |
dc.subject | ACYCLIC DIRECTED NON - STOCHASTIC NETWORK | en_US |
dc.subject | SCHEDULING AND RESOURCE LEVELLING | en_US |
dc.subject | CPM NETWORK | en_US |
dc.title | THE ACYCLIC DIRECTED NON - STOCHASTIC NETWORK ( SCHEDULING AND RESOURCE LEVELLING) | en_US |
dc.type | M.Tech Dessertation | en_US |
dc.accession.number | 108418 | en_US |
Appears in Collections: | MASTERS' THESES (Civil Engg) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CED108418.pdf | 10.93 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.