IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i9p2135-2146.html
   My bibliography  Save this article

Approximation algorithms for makespan minimization on identical parallel machines under resource constraints

Author

Listed:
  • Vitaly A. Strusevich

Abstract

The problem of minimizing the makespan on parallel identical machines is considered in the presence of additional resources, provided that some jobs at any time of their processing require one unit of a particular resource. We establish a lower bound on the worst-case performance of any group technology algorithm, which schedules the composite jobs formed of the original jobs that require the same resource. A simple group technology algorithm is given such that in the worst case no group technology algorithm performs better. An algorithm for the two-machine case is presented which guarantees a tight worst-case performance ratio of 6/5.

Suggested Citation

  • Vitaly A. Strusevich, 2021. "Approximation algorithms for makespan minimization on identical parallel machines under resource constraints," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(9), pages 2135-2146, September.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:9:p:2135-2146
    DOI: 10.1080/01605682.2020.1772019
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1772019
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1772019?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.

    More about this item

    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:taf:tjorxx:v:72:y:2021:i:9:p:2135-2146. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.