IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v337y2024i2d10.1007_s10479-023-05596-9.html
   My bibliography  Save this article

Algorithms to compute the energetic lower bounds of the cumulative scheduling problem

Author

Listed:
  • Jacques Carlier

    (Sorbonne Universités, Université de Technologie de Compiègne)

  • Antoine Jouglet

    (Sorbonne Universités, Université de Technologie de Compiègne)

  • Abderrahim Sahli

    (Univ Gustave Eiffel, ESIEE Paris, COSYS/GRETTIA)

Abstract

The aim of this paper is to propose efficient algorithms for computing the energetic lower bounds of the cumulative sheduling problem. So we have to schedule in a minimal makespan a set of non preemptive tasks on a resource with a given capacity. A task has a release date, a processing time and a tail and requires a given amount of the resource capacity during its processing. The energetic lower bound is the largest value of the makespan such that the energetic reasoning check cannot detect unfeasability. We report some algorithms to practically compute this lower bound with efficient complexity. These algorithms rely on iterative augmentations of $$C_{max}$$ C max until the cumulative constraint or the energetic constraint is satisfied. Our Computational results show their practical efficiencies.

Suggested Citation

  • Jacques Carlier & Antoine Jouglet & Abderrahim Sahli, 2024. "Algorithms to compute the energetic lower bounds of the cumulative scheduling problem," Annals of Operations Research, Springer, vol. 337(2), pages 683-713, June.
    • Handle: RePEc:spr:annopr:v:337:y:2024:i:2:d:10.1007_s10479-023-05596-9
    DOI: 10.1007/s10479-023-05596-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05596-9
    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/s10479-023-05596-9?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:annopr:v:337:y:2024:i:2:d:10.1007_s10479-023-05596-9. 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.