IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i7d10.1057_palgrave.jors.2600764.html
   My bibliography  Save this article

A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints

Author

Listed:
  • P S Ansell

    (University of Newcastle upon Tyne)

  • K D Glazebrook

    (University of Newcastle upon Tyne)

  • I Mitrani

    (University of Newcastle upon Tyne)

  • J Niño-Mora

    (Universitat Pompeu Fabra)

Abstract

Classical analyses of the dynamic control of multi-class queueing systems frequently yield simple priority policies as optimal. However, such policies can often result in excessive queue lengths for the low priority jobs/customers. We propose a stochastic optimisation problem in the context of a two class M/M/1 system which seeks to mitigate this through the imposition of constraints on the second moments of queue lengths. We analyse the performance of two families of parametrised heuristic policies for this problem. To evaluate these policies we develop lower bounds on the optimum cost through the achievable region approach. A numerical study points to the strength of performance of threshold policies and to directions for future research.

Suggested Citation

  • P S Ansell & K D Glazebrook & I Mitrani & J Niño-Mora, 1999. "A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 765-773, July.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:7:d:10.1057_palgrave.jors.2600764
    DOI: 10.1057/palgrave.jors.2600764
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600764
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600764?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:50:y:1999:i:7:d:10.1057_palgrave.jors.2600764. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.