<?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>Multi-resource leveling in a multi-project environment</title>
  </titleInfo>
  <name type="personal">
    <namePart>Shi, Jiangfeng</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Tabucanon, Mario T.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Pastijn, Hugo</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Nagarur, Nagendra N.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Asian Institute of Technology Partial</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1994</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>87 leaves</extent>
  </physicalDescription>
  <abstract>This Thesis pertains to the study multi- project scheduling  with multi-resource problem. A budget leveling mathematical model  is 'developed . It creates t he linkage between resource con strained  project scheduling problem and the resource leveling problem, and  makes the mathematical scheduling tool close to the practices.  The consideration of project scheduling and the Time/Cost trade  off are integrates in the budget leveling model . The mode l also  supports a wide range of flexibility and feasibility to the  project scheduling procedure , especially when the resource  loading modes are applied in different level s of p r oject  management. The experiences of pro ject managers and technical  specifications are possibly concerned in t his model through the  resource loading modes. The mode l supports an opportunity to the  practice for reducing computation time by decomposing problem  into different  detail or in  levels, or considering the resource ' s cost  brief, and etc . After testing the numerical  in  and  practical data , the results show that the model has advantage  over heuristic method (Minimum Slack Rule) especially on  producing the feasible solution . The model is possible t o  generate the feasible optimal solution in a short time period,  when the real case data is applied . </abstract>
  <note>A thesis submitted in partial fulfillment of the requirement for the degree of Master  of Engineering, School of Engineering and Technology</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1994</note>
  <subject authority="lcsh">
    <topic>Industrial project management</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. IE-94-30</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=B15424</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B15424</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">      </recordCreationDate>
    <recordChangeDate encoding="iso8601">20260818155901.0</recordChangeDate>
  </recordInfo>
</mods>
