IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v52y2020i4p478-485.html
   My bibliography  Save this article

Three parallel task assignment problems with shared resources

Author

Listed:
  • Ali Diabat
  • Alexandre Dolgui
  • Władysław Janiak
  • Mikhail Y. Kovalyov

Abstract

We study three optimization problems in which non-renewable resources are used to execute tasks in parallel. Problems differentiate by the assumptions of whether a resource can be shared between several tasks or not, or whether resource sharing between the tasks is limited. We present very efficient solution procedures for two of these problems and prove that the third problem is NP-hard in the strong sense and that it can be solved efficiently for special cases. Applications include optimal resource allocation problems in labor-intensive cellular manufacturing and in parallel task computing.

Suggested Citation

  • Ali Diabat & Alexandre Dolgui & Władysław Janiak & Mikhail Y. Kovalyov, 2020. "Three parallel task assignment problems with shared resources," IISE Transactions, Taylor & Francis Journals, vol. 52(4), pages 478-485, April.
    • Handle: RePEc:taf:uiiexx:v:52:y:2020:i:4:p:478-485
    DOI: 10.1080/24725854.2019.1680907
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2019.1680907
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2019.1680907?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:uiiexx:v:52:y:2020:i:4:p:478-485. 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/uiie .

    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.