<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">386350493</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307111827.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e198910  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1017/S0269964800001364</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0269964800001364</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.1017/S0269964800001364</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Tandem Conveyor Queues</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper analyzes a queueing system in which a constant-speed conveyor brings new items for service and carries away served items. The conveyor is a sequence of cells each able to hold at most one item. At each integer time, a new cell appears at the queue's input position. This cell holds an item requiring service with probability a, holds a passerby requiring no service with probability b, and is empty with probability (1- a - b). Service times are integers synchronized with the arrival of cells at the input, and they are geometrically distributed with parameter μ. Items requiring service are placed in an unbounded queue to await service. Served items are put in a second unbounded queue to await replacement on the conveyor in cells at the input position. Two models are considered. In one, a served item can only be placed into a cell that was empty on arrival; in the other, the served item can be placed into a cell that was either empty or contained an item requiring service (in the latter case unloading and loading at the input position can take place in the same time unit). The stationary joint distribution of the numbers of items in the two queues is studied for both models. It is verified that, in general, this distribution does not have a product form. Explicit results are worked out for special cases, e.g., when b = 0, and when all service times are one time unit (μ = 1). It is shown how the analysis of the general problem can be reduced to the solution of a Riemann boundary-value problem.</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">Baccelli</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">International de Recherche en Informatique et en Automatique 06565 Valbonne Cedex, France</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Coffman</subfield>
   <subfield code="D">E.G.</subfield>
   <subfield code="u">AT&amp;T Bell Laboratories Murray Hill, New Jersey 07974</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Gilbert</subfield>
   <subfield code="D">E.N.</subfield>
   <subfield code="u">AT&amp;T Bell Laboratories Murray Hill, New Jersey 07974</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/4(1989-10), 517-536</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:4&lt;517</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/S0269964800001364</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/S0269964800001364</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">Baccelli</subfield>
   <subfield code="D">F.</subfield>
   <subfield code="u">International de Recherche en Informatique et en Automatique 06565 Valbonne Cedex, France</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">Coffman</subfield>
   <subfield code="D">E.G.</subfield>
   <subfield code="u">AT&amp;T Bell Laboratories Murray Hill, New Jersey 07974</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">Gilbert</subfield>
   <subfield code="D">E.N.</subfield>
   <subfield code="u">AT&amp;T Bell Laboratories Murray Hill, New Jersey 07974</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/4(1989-10), 517-536</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:4&lt;517</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>
