IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v114y2024ics0304406824000867.html
   My bibliography  Save this article

The on-line transfer rule for queueing with arrivals

Author

Listed:
  • Han, Changyong
  • Chun, Youngsub
  • Mitra, Manipushpak
  • Mutuswami, Suresh

Abstract

We consider the queueing problem with arrivals, or the arrival queueing problem, where agents arrive at different (time) slots to process their jobs in a service facility and each job requires the same amount of processing time which is normalized to one. Each agent has one job to process and the facility can process only one job at each slot. We introduce a rule for the arrival queueing problem, which we call the on-line transfer rule, by adapting the minimal transfer rule of the static queueing problem (Maniquet, 2003) but incorporating the time span which each agent observes. We provide axiomatic characterizations of the on-line transfer rule by imposing the axioms of efficiency, Pareto indifference, equal treatment of equals, independence of larger costs, and consistency from later-arrived-later-served agents. We also introduce and characterize an alternative rule for the arrival queueing problem which adapts the maximal transfer rule of the static queueing problem (Chun, 2006a).

Suggested Citation

  • Han, Changyong & Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2024. "The on-line transfer rule for queueing with arrivals," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    • Handle: RePEc:eee:mateco:v:114:y:2024:i:c:s0304406824000867
    DOI: 10.1016/j.jmateco.2024.103026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406824000867
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2024.103026?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:eee:mateco:v:114:y:2024:i:c:s0304406824000867. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.