Skip to main content
SpringerLink
Log in

A multiobjective control approach to priority queues

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Departamento de Sistemas, UAM-Azcapotzalco, Ave. San Pablo No. 180, 02200 México D.F., México, , , , , , MX

    Onésimo Hernández-Lerma & Luis F. Hoyos-Reyes

Authors
  1. Onésimo Hernández-Lerma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis F. Hoyos-Reyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: June 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hernández-Lerma, O., Hoyos-Reyes, L. A multiobjective control approach to priority queues. Mathematical Methods of OR 53, 265–277 (2001). https://doi.org/10.1007/PL00003995

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00003995

Search

Navigation