IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v321y2025i3p750-759.html
   My bibliography  Save this article

Analyzing the price of fairness in scheduling problems with two agents

Author

Listed:
  • Yu, Jin
  • Liu, Peihai
  • Lu, Xiwen
  • Gu, Manzhan

Abstract

This paper focuses on the price of fairness in several scheduling problems with two agents, each with a set of nonpreemptive jobs, competing to execute their respective jobs on a single machine. Each agent expects to minimize its objective function, which depends on the completion times of its own jobs. Several objective functions are considered, including makespan, total (weighted) completion time and maximum tardiness. We focus on problems in which both agents pursue the same objective function. For each problem, we analyze the price of fairness and the complexity to find the fairness schedules among the Pareto optimal schedules. When the objective functions of both agents are total completion time, we design an algorithm to generate a near-fair solution and analyze its price of fairness.

Suggested Citation

  • Yu, Jin & Liu, Peihai & Lu, Xiwen & Gu, Manzhan, 2025. "Analyzing the price of fairness in scheduling problems with two agents," European Journal of Operational Research, Elsevier, vol. 321(3), pages 750-759.
    • Handle: RePEc:eee:ejores:v:321:y:2025:i:3:p:750-759
    DOI: 10.1016/j.ejor.2024.10.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724007987
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.10.023?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:ejores:v:321:y:2025:i:3:p:750-759. 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/eor .

    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.