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

Akturk, M. Selim; Atamturk, Alper; 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="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:zenodo.org:26901</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain manufacturing cost, which is a convex function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the manufacturing cost due to compression of the jobs low. Thus, one is faced with a tradeoff between matchup time and manufacturing cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/cost tradeoff.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Akturk, M. Selim</subfield>
    <subfield code="u">Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:4b571461b109e3b2ef69d3277e68a0eb</subfield>
    <subfield code="s">159</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/26901/files/bib-b56ca5b1-c4c0-4c5c-b56e-96e5002ad102.txt</subfield>
  </datafield>
  <controlfield tag="005">20210315121429.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2010-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s10951-009-0111-2</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Parallel machine match-up scheduling with manufacturing cost considerations</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="v">13</subfield>
    <subfield code="p">JOURNAL OF SCHEDULING</subfield>
    <subfield code="c">95-110</subfield>
    <subfield code="n">1</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Atamturk, Alper</subfield>
    <subfield code="u">Univ Calif Berkeley, Dept Ind Engn &amp; Operat Res, Berkeley, CA 94720 USA</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Gurel, Sinan</subfield>
    <subfield code="u">Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</subfield>
  </datafield>
  <controlfield tag="001">26901</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>