IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i5d10.1007_s10878-021-00702-8.html
   My bibliography  Save this article

Exact algorithms for scheduling programs with shared tasks

Author

Listed:
  • Imed Kacem

    (Université de Lorraine)

  • Giorgio Lucarelli

    (Université de Lorraine)

  • Théo Nazé

    (Université de Lorraine)

Abstract

We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks have to be performed only once. This kind of problem is known in the literature under the names of VM-PACKING or PAGINATION. Our objective is to schedule a set of these objects on two parallel identical machines, with the aim of minimizing the makespan. This problem is NP-complete as an extension of the PARTITION problem. In this paper we present three exact algorithms with worst-case time-complexity guarantees, by exploring different branching techniques. Our first algorithm focuses on the relation between jobs sharing one or more symbols in common, whereas the two other algorithms branches on the shared symbols.

Suggested Citation

  • Imed Kacem & Giorgio Lucarelli & Théo Nazé, 2022. "Exact algorithms for scheduling programs with shared tasks," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1602-1627, July.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-021-00702-8
    DOI: 10.1007/s10878-021-00702-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00702-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-021-00702-8?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:spr:jcomop:v:43:y:2022:i:5:d:10.1007_s10878-021-00702-8. 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.