IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v3y2022i4d10.1007_s43069-022-00172-6.html
   My bibliography  Save this article

Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource Constraint Revisited

Author

Listed:
  • Sévérine Fetgo Betmbe

    (University of Dschang)

  • Clémentin Tayou Djamegni

    (University of Dschang
    University of Dschang)

Abstract

The success of constraint programming on scheduling problems comes from the low complexity and power of propagators. The data structure Profile recently introduced by Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, when applied to the edge-finder rule for the cumulative resource constraint (which we call horizontally elastic edge-finder) has improved the filtering power of this rule. In this paper, the algorithm proposed by Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016 is revisited. It is proved that the data structure Profile can be further used for more adjustments. A new formulation of the horizontally elastic edge-finder rule is put forward. Similar to Gingras and Quimper in Generalizing the edge-finder rule for the cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, an $$\mathcal {O}(kn^2)$$ O ( k n 2 ) algorithm (where n is the number of tasks sharing the resource and $$k\le n$$ k ≤ n , the number of distinct capacities required by tasks) based on new attributes of the Profile data structure is proposed for the new rule. Experimental results on instances of Resource-Constrained Project Scheduling Problems (RCPSPs) from the benchmark suites highlight that using this new algorithm reduces the number of backtracks for the majority of instances with a slight increase in running time.

Suggested Citation

  • Sévérine Fetgo Betmbe & Clémentin Tayou Djamegni, 2022. "Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource Constraint Revisited," SN Operations Research Forum, Springer, vol. 3(4), pages 1-32, December.
    • Handle: RePEc:spr:snopef:v:3:y:2022:i:4:d:10.1007_s43069-022-00172-6
    DOI: 10.1007/s43069-022-00172-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-022-00172-6
    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/s43069-022-00172-6?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.

    References listed on IDEAS

    as
    1. Carlier, J. & Neron, E., 2003. "On linear lower bounds for the resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 149(2), pages 314-324, September.
    2. Luc Mercier & Pascal Van Hentenryck, 2008. "Edge Finding for Cumulative Scheduling," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 143-153, February.
    3. Roger Kameugne & Laure Pauline Fotso, 2013. "A cumulative not-first/not-last filtering algorithm in O(n 2log(n))," Indian Journal of Pure and Applied Mathematics, Springer, vol. 44(1), pages 95-115, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    2. Hamed Fahimi & Claude-Guy Quimper, 2023. "Overload-Checking and Edge-Finding for Robust Cumulative Scheduling," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1419-1438, November.
    3. Arkhipov, Dmitry & Battaïa, Olga & Lazarev, Alexander, 2019. "An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 35-44.
    4. Carlier, Jacques & Neron, Emmanuel, 2007. "Computing redundant resources for the resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1452-1463, February.
    5. Mostafa Khatami & Amir Salehipour, 2021. "A binary search algorithm for the general coupled task scheduling problem," 4OR, Springer, vol. 19(4), pages 593-611, December.
    6. Nicolas Beldiceanu & Mats Carlsson & Sophie Demassey & Emmanuel Poder, 2011. "New filtering for the cumulative constraint in the context of non-overlapping rectangles," Annals of Operations Research, Springer, vol. 184(1), pages 27-50, April.
    7. Thierry Petit & Emmanuel Poder, 2011. "Global propagation of side constraints for solving over-constrained problems," Annals of Operations Research, Springer, vol. 184(1), pages 295-314, April.
    8. Coughlan, Eamonn T. & Lübbecke, Marco E. & Schulz, Jens, 2015. "A branch-price-and-cut algorithm for multi-mode resource leveling," European Journal of Operational Research, Elsevier, vol. 245(1), pages 70-80.
    9. Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2014. "Approximability results for the resource-constrained project scheduling problem with a single type of resources," Annals of Operations Research, Springer, vol. 213(1), pages 115-130, February.
    10. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    11. Roger Kameugne & Laure Pauline Fotso, 2013. "A cumulative not-first/not-last filtering algorithm in O(n 2log(n))," Indian Journal of Pure and Applied Mathematics, Springer, vol. 44(1), pages 95-115, February.
    12. François Clautiaux & Cláudio Alves & José Valério de Carvalho, 2010. "A survey of dual-feasible and superadditive functions," Annals of Operations Research, Springer, vol. 179(1), pages 317-342, September.

    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:snopef:v:3:y:2022:i:4:d:10.1007_s43069-022-00172-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.