1 Ocak 2017 Dergi makalesi Açık Erişim

Caglar, Musa; Gurel, Sinan

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="n">3</subfield>
    <subfield code="c">659-687</subfield>
    <subfield code="v">39</subfield>
    <subfield code="p">OR SPECTRUM</subfield>
  </datafield>
  <controlfield tag="005">20210316135003.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:97887</subfield>
    <subfield code="p">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Caglar, Musa</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">In this study, we address a public R&amp;amp;D project portfolio selection problem with project cancellations. For several reasons, a funded R&amp;amp;D project may be halted before finishing the planned research. When a project is canceled, most of its budget is usually unused and also some of the spendings can return to the funding organization. In the call-based R&amp;amp;D programs, usually project selection decisions are made in one go, and, in the current call, it is not possible to award new projects with the unused budget. Decision-makers (DMs) of funding organizations can benefit from considering possible project cancellation situations to improve the budget utilization. We consider two cases. In the first case, we assume that cancellation probability of a project cannot be assessed but the DM can estimate the number of projects that will be canceled. In the second case, we assume that for each project, a cancellation probability can be assessed. For the first problem, we develop a mixed-integer linear programming formulation and a dynamic programming algorithm. For the second problem, we develop a chance-constrained stochastic programming formulation that can be solved as a mixed-integer second-order cone program. Our computational results show that practical-size problems can be solved by the proposed solution approaches.</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</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>
  <controlfield tag="001">97887</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Public R&amp;D project portfolio selection problem with cancellations</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2017-01-01</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Middle East Tech Univ, Ind Engn Dept, Inonu Bulvari, TR-06800 Ankara, Turkey</subfield>
    <subfield code="a">Gurel, Sinan</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/97887/files/bib-43823242-cae7-4723-af50-4f602ceedd8d.txt</subfield>
    <subfield code="s">126</subfield>
    <subfield code="z">md5:b47f151de915a9826c22c067f32aca2c</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s00291-016-0468-5</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>