<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">386350272</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307111827.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e198907  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1017/S0269964800001194</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0269964800001194</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.1017/S0269964800001194</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We wish to schedule heterogeneous jobs on a single machine to stochastically maximize the number of jobs that are correctly completed before a random due date. Jobs arrive according to an arbitrary arrival process. Job i has probability ci, that it will be correctly completed, and a processing time that has distribution Fi. Jobs that are incorrectly processed cannot be reprocessed, and jobs that are not completed by the due date are assumed to be incorrectly processed. The machine is subject to breakdowns and repairs. Both premptive and non-preemptive policies are considered. We give conditions under which simple index rules are optimal. This generalizes and extends the results of Derman et al. [3], Pinedo and Rammouz [9], and Buyukkoc et al. [2], who derive policies that maximize the expected number of jobs correctly completed by the due date. We also consider policies that stochastically minimize the number of correct job completions. For single class systems, we give conditions under which FCFS (first-come-first-served) or LAST (least-attained-service-time) service disciplines stochastically minimize or maximize the number in the system.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Cambridge University Press 1989</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Righter</subfield>
   <subfield code="D">Rhonda</subfield>
   <subfield code="u">Department of Decision and In formation Sciences Santa Clara University Santa Clara, California 95053</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Shanthikumar</subfield>
   <subfield code="D">J. George</subfield>
   <subfield code="u">School of Business Administration University of California Berkeley, California 94720</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Probability in the Engineering and Informational Sciences</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">3/3(1989-07), 323-333</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:3&lt;323</subfield>
   <subfield code="1">1989</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">PES</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1017/S0269964800001194</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1017/S0269964800001194</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Righter</subfield>
   <subfield code="D">Rhonda</subfield>
   <subfield code="u">Department of Decision and In formation Sciences Santa Clara University Santa Clara, California 95053</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Shanthikumar</subfield>
   <subfield code="D">J. George</subfield>
   <subfield code="u">School of Business Administration University of California Berkeley, California 94720</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Probability in the Engineering and Informational Sciences</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">3/3(1989-07), 323-333</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:3&lt;323</subfield>
   <subfield code="1">1989</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">PES</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-cambridge</subfield>
  </datafield>
 </record>
</collection>
