IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v44y2013i1d10.1007_s13226-013-0005-z.html
   My bibliography  Save this article

A cumulative not-first/not-last filtering algorithm in O(n 2log(n))

Author

Listed:
  • Roger Kameugne

    (University of Maroua
    University of Yaoundé I)

  • Laure Pauline Fotso

    (University of Yaoundé I)

Abstract

In cumulative and disjunctive constraint-based scheduling, the resource constraint is enforced by several filtering rules. Among these rules, we have (extended) edge-finding and not-first/not-last rules. The not-first/not-last rule detects tasks that cannot run first/last relatively to a set of tasks and prunes their time bounds. In this paper, it is presented a sound O (n 2 log n) algorithm for the cumulative not-first/not-last rule where n is the number of tasks. This algorithm reaches the same fix point as previous not-first/not-last algorithms, although it may take additional iterations to do so. The worst case complexity of this new algorithm for the maximal adjustment is the same as our previous complete O (n 2|H| log n) not-first/not-last algorithm [7] where |H| is the maximum between the number of distinct earliest completion and latest start times of tasks. But, experimental results on benchmarks from the Project Scheduling Problem Library (PSPLib) and the Baptiste and Le Pape data set (BL) suggest that the new not-first/not-last algorithm has a substantially reduced runtime. Furthermore, the results demonstrate that in practice the new algorithm rarely requires more propagations than previous not-first/not-last algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:indpam:v:44:y:2013:i:1:d:10.1007_s13226-013-0005-z
    DOI: 10.1007/s13226-013-0005-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-013-0005-z
    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/s13226-013-0005-z?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. Torres, Philippe & Lopez, Pierre, 2000. "On Not-First/Not-Last conditions in disjunctive scheduling," European Journal of Operational Research, Elsevier, vol. 127(2), pages 332-343, December.
    2. Luc Mercier & Pascal Van Hentenryck, 2008. "Edge Finding for Cumulative Scheduling," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 143-153, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    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. 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.
    2. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Peridy, Laurent & Rivreau, David, 2005. "Local adjustments: A general algorithm," European Journal of Operational Research, Elsevier, vol. 164(1), pages 24-38, July.
    8. Konstantin Artiouchine & Philippe Baptiste & Juliette Mattioli, 2008. "The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 222-233, May.
    9. Laurent Michel & Andrew See & Pascal Van Hentenryck, 2009. "Transparent Parallelization of Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 363-382, August.

    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:indpam:v:44:y:2013:i:1:d:10.1007_s13226-013-0005-z. 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.