{
  "id": "1106.0074",
  "version": "v1",
  "published": "2011-06-01T01:26:47.000Z",
  "updated": "2011-06-01T01:26:47.000Z",
  "title": "A Bound on the Variance of the Waiting Time in a Queueing System",
  "authors": [
    "Patrick Eschenfeldt",
    "Ben Gross",
    "Nicholas Pippenger"
  ],
  "comment": "4 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "Kingman has shown, under very weak conditions on the interarrival- and sevice-time distributions, that First-Come-First-Served minimizes the variance of the waiting time among possible service disciplines. We show, under the same conditions, that Last-Come-First-Served maximizes the variance of the waiting time, thereby giving an upper bound on the variance among all disciplines.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-06-01T01:26:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60K26",
      "90B22"
    ],
    "keywords": [
      "waiting time",
      "queueing system",
      "service disciplines",
      "weak conditions",
      "upper bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1106.0074E"
    }
  }
}