<?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>Practical resources levelling using programming techniques</title>
  </titleInfo>
  <name type="personal">
    <namePart>Gopalaratnam, Vellore Shroff</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Scott, David</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="personal">
    <namePart>Usami, Tsutomu</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>United Kingdom Government</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>1978</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>50 p.</extent>
  </physicalDescription>
  <abstract>Most early applications of the Critical Path Method did not consider the resources required to complete each activity. Recently, increased attention has been given to this problem, and several methods have been  suggested for scheduling activities which compete for resources which are available in stated maximum amounts. However, as of date, little has been done to increase resource utilization by smoothening resource demands along the project duration.  This study undertakes to develop the Least Squares Method using the concept of Weighted Integer Multipliers for levelling single as well as  multiple resource cases. A numerical example using a small hypothetical eight activity network is presented. Further computational experience  with a more realistic 25 activity bridge construction network is reported.  A possible extension of the approach to fixed time, multiple resources levelling cases for more complex networks is also suggested. It is concluded that the approach of the type given herein holds gr eat potential  and is worthy of further investigation. </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, 1978</note>
  <subject authority="lcsh">
    <topic>Critical path analysis</topic>
    <topic>Programmed instruction</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. 1340</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=B22937</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B22937</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">250398</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818173735.0</recordChangeDate>
  </recordInfo>
</mods>
