Skip to main content

Advertisement

Springer Nature Link
Log in

Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding and not-first/not-last are the most popular filtering algorithms for unary resources. In this paper we introduce new O(n log n) versions of these two filtering algorithms and one more O(n log n) filtering algorithm called detectable precedences. These algorithms use a special data structures Θ-tree and Θ-Λ-tree. These data structures are especially designed for “what-if” reasoning about a set of activities so we also propose to use them for handling so called optional activities, i.e. activities which may or may not appear on the resource. In particular, we propose new O(n log n) variants of filtering algorithms which are able to handle optional activities: overload checking, detectable precedences and not-first/not-last.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. OR Library. http://mscmga.ms.ic.ac.uk/info.html.

  2. Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group.

  3. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers.

  4. Barták, R. (2003). Dynamic global constraints in backtracking based environments. Ann. Oper. Res. 118: 101–118.

    Article  Google Scholar 

  5. Beck, J.C., & Fox, M.S. (1999). Scheduling alternative activities. In AAAI/IAAI, pages 680–687.

  6. Carlier, J., & Pinson, E. (1994). Adjustments of head and tails for the job-shop problem. Eur. J. Oper. Res. 78: 146–161.

    Article  Google Scholar 

  7. Caseau, Y., & Laburthe, F. (1994). Improved CLP scheduling with task intervals'. In van Hentenryck, P., ed., Proceedings of the 11th International Conference on Logic Programming, ICLP'94.

  8. Colombani, Y. (1996). CP: an efficient and partical approach to solving the job-shop problem. In Principles and Practice of Constraint Programming—CP 1996.

  9. Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling.

  10. Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Company.

    Google Scholar 

  11. Martin, P., & Shmoys, D.B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Cunningham, W.H., McCormick, S.T. and Queyranne, M., eds., Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, IPCO'96, pages 389–403. Vancouver, British Columbia, Canada.

  12. Torres, P., & Lopez, P. (1999). On not-first/not-last conditions in disjunctive scheduling. European Journal of Operational Research.

  13. Vilm, P. (2002). Batch processing with sequence dependent setup times: new results. In Proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC'02, Gliwice, Poland.

  14. Vilm, P. (2004). O(n log n) filtering algorithms for unary resource constraint. In Proceedings of CP-AI-OR 2004.

  15. Wolf, A. (2003). Pruning while sweeping over task intervals. In Principles and Practice of Constraint Programming—CP 2003. Kinsale, Ireland.

  16. Wolf, A., & Schlenker, H. (2004). Realizing the alternative resources constraint problem with single resource constraints. In To Appear in Proceedings of the INAP Workshop 2004.

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 2/25, Praha, 1, Czech Republic

    Petr Vilím, Roman Barták & Ondřej Čepek

Authors
  1. Petr Vilím
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Barták
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Čepek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petr Vilím.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vilím, P., Barták, R. & Čepek, O. Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints 10, 403–425 (2005). https://doi.org/10.1007/s10601-005-2814-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10601-005-2814-0

Keywords

Search

Navigation