<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02009199</id>
  <dt>j</dt>
  <an>02009199</an>
  <augroup>
    <au>Kim, Yong J.</au>
    <au>Mannino, Michael V.</au>
  </augroup>
  <ti>Optimal incentive-compatible pricing for $M/G/1$ queues.</ti>
  <so>Oper. Res. Lett. 31, No. 6, 459-461 (2003).</so>
  <py>2003</py>
  <pu>Elsevier Science Publishers (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Queues</ut>
    <ut>Priority</ut>
    <ut>Stochastic model applications</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl 0822.90060</ci>
    <ci>Zbl 0723.90023</ci>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/S0167-6377(03)00060-9</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper extends the applicability of the pricing results of {\it H. Mendelson} and {\it S. Whang} [Oper. Res. 38, No. 5, 870--883 (1990; Zbl 0723.90023)] and {\it K. R. Balachandran} and {\it S. Radhakrishnan} [Manage. Sci. 40, No. 10, 1353--1360 (1994; Zbl 0822.90060)] for congested service facilities by considering general, class-dependent, service time distributions. Two theorems for nonpreemptive $M/G/1$ queues and preemptive-resume $M/G/1$ queues are presented.</ab>
    <rv></rv>
  </abgroup>
</item>