Construction network compression programming

AuthorChang, Hung-jen
Call NumberAIT Thesis no.797
Subject(s)Structural engineering
Building--Details
NoteA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering at the Asian Institute of Technology, Bangkok, Thailand.
PublisherAsian Institute of Technology
AbstractA 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.
Year1975
TypeThesis
SchoolStudent Research Before 1980
DepartmentOther Field of Studies (No Department)
Academic Program/FoSThesis (Year <=1979)
Chairperson(s)Tongchat Hongladaromp
Examination Committee(s)Morino, Shosuke
DegreeThesis (M. Eng.) - Asian Institute of Technology, 1975


Usage Metrics
View Detail3
Read PDF0
Download PDF0