<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>00790502</id>
  <dt>j</dt>
  <an>00790502</an>
  <augroup>
    <au>Goemans, Michel X.</au>
  </augroup>
  <ti>An approximation algorithm for scheduling on three dedicated machines.</ti>
  <so>Discrete Appl. Math. 61, No.1, 49-59 (1995).</so>
  <py>1995</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>scheduling problem</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0166-218X(94)00160-F</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We consider the scheduling problem of minimizing the makespan on three dedicated machines. We present a $7 \over 6$-approximation algorithm, improving the previously best performance guarantee of $5 \over 4$.</ab>
    <rv></rv>
  </abgroup>
</item>