AI SearchConstruction network compression programming
Call Number: AIT Thesis no.797 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. 797Publication details: Bangkok : Asian Institute of Technology, 1975Description: 52 pSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1975 Summary: A construction project is represented by a network with activities on arrows. All activities can be randomly arranged and events randomly numbered without repetition prior to computer processing. Cost functions are assumed to be linear. A structural model composed of columns and plates is proposed to represent activities and events of corresponding network. An algorithm is presented based on the model. A computer program in FORTRAN IV is then developed to serve the following functions: a. Checking illegal conditions of a network described above, b. Reordering the sequence of input activities. c. Renumbering events of the network in ascending order. d. Performing critical path scheduling. e . Compressing the network to a required completion time. A desired schedule is obtained regarding its minimum project cost.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.797 (Browse shelf(Opens below)) | 2 | Available | 30050120586630 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.797 (Browse shelf(Opens below)) | Available | 30050160092127 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering at the Asian Institute of Technology, Bangkok, Thailand.
Thesis (M.Eng.) - Asian Institute of Technology, 1975
A construction project is represented by a network with activities on arrows. All activities can be randomly arranged and events randomly numbered without repetition prior to computer processing. Cost functions are assumed to be linear. A structural model composed of columns and plates is proposed to represent activities and events of corresponding network. An algorithm is presented based on the model. A computer program in FORTRAN IV is then developed to serve the following functions: a. Checking illegal conditions of a network described above, b. Reordering the sequence of input activities. c. Renumbering events of the network in ascending order. d. Performing critical path scheduling. e . Compressing the network to a required completion time. A desired schedule is obtained regarding its minimum project cost.
There are no comments on this title.