IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02089421.html
   My bibliography  Save this paper

The price of envy-freeness in machine scheduling

Author

Listed:
  • Vittorio Bilò

    (Università del Salento = University of Salento [Lecce], Department of Mathematics and Physics - Università del Salento = University of Salento [Lecce])

  • Angelo Fanelli

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique)

  • Michele Flammini

    (DISIM - Department of Information Engineering, Computer Science and Mathematics = Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica [L'Aquila] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila)

  • Gianpiero Monaco

    (DISIM - Department of Information Engineering, Computer Science and Mathematics = Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica [L'Aquila] - UNIVAQ - Università degli Studi dell'Aquila = University of L'Aquila = Université de L'Aquila)

  • Luca Moscardelli

    (Dipartimento di Scienze - Universita di Chieti-Pescara - UNICH - Universita' degli Studi "G. d'Annunzio" Chieti-Pescara)

Abstract

We consider k-envy-free assignments for scheduling problems in which the completion time of each machine is not k times larger than the one she could achieve by getting the jobs of another machine, for a given factor . We introduce and investigate the notion of price of k-envy-freeness, defined as the ratio between the makespan of the best k-envy-free assignment and that of an optimal allocation achievable without envy-freeness constraints. We provide exact or asymptotically tight bounds on the price of k-envy-freeness for all the basic scheduling models, that is unrelated, related and identical machines. Moreover, we show how to efficiently compute such allocations with a worsening multiplicative factor being at most the best approximation ratio for the minimum makespan problem guaranteed by a polynomial time algorithm for each specific model. Finally, we extend our results to the case of restricted assignments and to the objective of minimizing the sum of the completion times of all the machines.

Suggested Citation

  • Vittorio Bilò & Angelo Fanelli & Michele Flammini & Gianpiero Monaco & Luca Moscardelli, 2016. "The price of envy-freeness in machine scheduling," Post-Print hal-02089421, HAL.
    • Handle: RePEc:hal:journl:hal-02089421
    DOI: 10.1016/j.tcs.2015.10.046
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Envy-freeness; Machine scheduling;

    Statistics

    Access and download statistics

    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:hal:journl:hal-02089421. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.