<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Compression of network with activity on the nodes</title>
  </titleInfo>
  <name type="personal">
    <namePart>Lin, Jung-shain</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Karasudhi, Pisidhi</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Jearkjirm, Vithool</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>The Government of  the Republic of China</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1976</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>33 p.</extent>
  </physicalDescription>
  <abstract>An algorithm is developed to reduce the duration of the project, which is represented in a form of precedence critical path network, by compressing the durations of selected activities in such a way that the increase in total project cost is minimum. Proposing a structural model  comprising of columns and plates which represent the activities in the network, the compression of the network is equivalent to the compression  of the structural model. A computer program is developed to carry out the compression algorithm.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering of the Asian Institute of Technology, Bangkok, Thailand</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1976</note>
  <subject authority="lcsh">
    <topic>Structural frames</topic>
    <topic>Models</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Compressibility</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. 957</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B22795</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B22795</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">200198</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818084448.0</recordChangeDate>
  </recordInfo>
</mods>
