Thesis Open Access

Multi-Objective Project Crashing Algorithm Selection

Haftom, Mehari


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">thesis</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">869937</subfield>
    <subfield code="u">https://nadre.ethernet.edu.et/record/10248/files/HaftomMehari.pdf</subfield>
    <subfield code="z">md5:5d13a5fa142c8bfbf86a77ccf2c96996</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Project crashing algorithm selection of a project is a crucial aspect of each project to decision makers striving to expedite or crash a project. In this study a new method has been introduced to choose alternatives based on the interest and preferences of decision makers due to the uncertainties of the optimal solutions of crashing algorithms. A multi criteria decision making (MCDM) technique, The Technique for Order of Preference using Similarity to Ideal Solution (TOPSIS) is used to select the appropriate crashing algorithm. The proposed method leads the decision makers to select the desirable algorithm to their projects. An example is analysed to demonstrate the capabilities of the present method.&lt;/p&gt;</subfield>
  </datafield>
  <controlfield tag="001">10248</controlfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Haftom, Mehari</subfield>
    <subfield code="u">Addis Ababa University</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Multi-Objective Project Crashing Algorithm Selection</subfield>
  </datafield>
  <controlfield tag="005">20200625061132.0</controlfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2014-09-01</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-aau</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-nadre</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="a">978-963-313-151-0</subfield>
    <subfield code="i">isPartOf</subfield>
    <subfield code="n">isbn</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="a">10.20372/nadre/10247</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="n">doi</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.20372/nadre/10248</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
</record>
137
13
views
downloads
All versions This version
Views 137137
Downloads 1313
Data volume 11.3 MB11.3 MB
Unique views 7272
Unique downloads 1212

Share

Cite as