IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v159y2008i1p53-6410.1007-s10479-007-0267-0.html
   My bibliography  Save this article

How good are SPT schedules for fair optimality criteria

Author

Listed:
  • Eric Angel
  • Evripidis Bampis
  • Fanny Pascual

Abstract

We consider the following scheduling setting: a set of n tasks have to be executed on a set of m identical machines. It is well known that shortest processing time (SPT) schedules are optimal for the problem of minimizing the total sum of completion times of the tasks. In this paper, we measure the quality of SPT schedules, from an approximation point of view, with respect to the following optimality criteria: sum of completion times per machine, global fairness, and individual fairness. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Eric Angel & Evripidis Bampis & Fanny Pascual, 2008. "How good are SPT schedules for fair optimality criteria," Annals of Operations Research, Springer, vol. 159(1), pages 53-64, March.
    • Handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:53-64:10.1007/s10479-007-0267-0
    DOI: 10.1007/s10479-007-0267-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0267-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0267-0?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. Wan, Long & Ding, Zhihao & Li, Yunpeng & Chen, Qianqian & Tan, Zhiyi, 2015. "Scheduling to minimize the maximum total completion time per machine," European Journal of Operational Research, Elsevier, vol. 242(1), pages 45-50.
    2. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.

    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:annopr:v:159:y:2008:i:1:p:53-64:10.1007/s10479-007-0267-0. 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.