IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v184y2011i1p295-31410.1007-s10479-010-0683-4.html
   My bibliography  Save this article

Global propagation of side constraints for solving over-constrained problems

Author

Listed:
  • Thierry Petit
  • Emmanuel Poder

Abstract

This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These side constraints control how the initial constraints of the model should be satisfied or violated, to obtain solutions that have a practical interest. They are specific to each application. In our experiments, we show the superiority of a framework where side constraints are encoded by global constraints on new domain variables, which are directly included into the model. The case-study is a cumulative scheduling problem with over-loads. The objective is to minimize the total amount of over-loads. We augment the Cumulative global constraint of the constraint programming solver Choco with sweep and task interval violation-based algorithms. We provide a theoretical and experimental comparison of the two main approaches for encoding over-constrained problems with side constraints. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:295-314:10.1007/s10479-010-0683-4
    DOI: 10.1007/s10479-010-0683-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0683-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0683-4?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. Luc Mercier & Pascal Van Hentenryck, 2008. "Edge Finding for Cumulative Scheduling," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 143-153, February.
    2. Ph. Baptiste & C. Le Pape & W. Nuijten, 1999. "Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems," Annals of Operations Research, Springer, vol. 92(0), pages 305-333, January.
    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. Carlier, Jacques & Neron, Emmanuel, 2000. "A new LP-based lower bound for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 363-382, December.
    2. 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.
    3. Guyon, O. & Lemaire, P. & Pinson, É. & Rivreau, D., 2010. "Cut generation for an integrated employee timetabling and production scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 557-567, March.
    4. 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.
    5. Xiangtong Qi & Jonathan F. Bard & Gang Yu, 2004. "Class Scheduling for Pilot Training," Operations Research, INFORMS, vol. 52(1), pages 148-162, February.
    6. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
    7. 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.
    8. 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.
    9. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.
    10. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    11. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
    12. 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.
    13. 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.
    14. 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.
    15. Néron, Emmanuel & Baptiste, Philippe & Gupta, Jatinder N. D., 2001. "Solving hybrid flow shop problem using energetic reasoning and global operations," Omega, Elsevier, vol. 29(6), pages 501-511, December.
    16. 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.

    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:184:y:2011:i:1:p:295-314:10.1007/s10479-010-0683-4. 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.