IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v53y2001i2p265-277.html
   My bibliography  Save this article

A multiobjective control approach to priority queues

Author

Listed:
  • Onésimo Hernández-Lerma
  • Luis F. Hoyos-Reyes

Abstract

This paper introduces a multiobjective control formulation of the priority assignment (PA) problem for a discrete-time single-server queueing system with q competing classes of customers, and the discounted cost criterion. A multiobjective priority assignment (MPA) problem is presented, which is analyzed from the viewpoint of both Pareto and lexicographic optimality. The cμ-rule, which is a well known optimal control policy for the PA problem, is shown to be Pareto optimal, strong Pareto optimal with respect to a certain norm on ℝ q , and also lexicographically optimal for MPA. These results are used to study a constrained PA problem. Copyright Springer-Verlag Berlin Heidelberg 2001

Suggested Citation

  • Onésimo Hernández-Lerma & Luis F. Hoyos-Reyes, 2001. "A multiobjective control approach to priority queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(2), pages 265-277, June.
    • Handle: RePEc:spr:mathme:v:53:y:2001:i:2:p:265-277
    DOI: 10.1007/PL00003995
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/PL00003995
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/PL00003995?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eitan Altman, 2007. "Comments on: Dynamic priority allocation via restless bandit marginal productivity indices," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 202-207, December.
    2. M. Zarepisheh & E. Khorram, 2011. "On the transformation of lexicographic nonlinear multiobjective programs to single objective programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(2), pages 217-231, October.
    3. Przemysław Korytkowski & Tomasz Wiśniewski, 2011. "Performance analysis of commercial offset printing under dynamic priority rules," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 53-64.

    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:spr:mathme:v:53:y:2001:i:2:p:265-277. 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.springer.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.