Abstract
Alternative resource constraint problems have to be solved in practical applications where several resources are available for the activities to be scheduled. In this paper, we present a modular approach to solve such problems which is based on single resource constraints. Furthermore, we present a new sweeping algorithm which performs some “global” overload checking for the alternative resource constraint problem. To our knowledge, this is the first presentation where “sweeping”, a well-known technique in computational geometry, was used to perform this checking efficiently.
For a practical evaluation of our approach, we implemented and integrated it into our Java constraint engine firstcs. We compared our implementation with the more general disjoint2 constraint in SICStus Prolog on some benchmark problems: the publicly available random placement problems (RPP).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baptiste, P., le Pape, C., Nuijten, W.: Constraint-Based Scheduling. International Series in Operations Research & Management Science, vol. 39. Kluwer Academic Publishers, Dordrecht (2001)
Barták, R., Müller, T., Rudová, H.: Minimal perturbation problem - a formal view. In: Proceedings of the Joint Annual Workshop of the ERCIM Working Group on Constraints and the CoLogNET area on Constraint and Logic Programming, MTA SZTAKI, Budapest, Hungary, June 30 – July 2 (2003)
Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 377–391. Springer, Heidelberg (2001)
Beldiceanu, N., Carlsson, M.: A new multi-resource cumulatives constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63–79. Springer, Heidelberg (2002)
Hoche, M., Müller, H., Schlenker, H., Wolf, A.: firstcs - A Pure Java Constraint Programming Engine. In: Hanus, M., Hofstedt, P., Wolf, A. (eds.) 2nd International Workshop on Multiparadigm Constraint Programming Languages – MultiCPL 2003, (September 29, 2003), Online available at, uebb.cs.tu-berlin.de/MultiCPL03/Proceedings.MultiCPL03.RCoRP03.pdf
Preparata, F.P., Shamos, M.I.: Computational Geometry, An Introduction. Texts and Monographs in Computer Science. Springer, Heidelberg (1985)
Vilím, P.: O(n logn) filtering algorithms for unary resource constraint. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 335–347. Springer, Heidelberg (2004)
Wolf, A.: Pruning while sweeping over task intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 739–753. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolf, A., Schlenker, H. (2005). Realising the Alternative Resources Constraint. In: Seipel, D., Hanus, M., Geske, U., Bartenstein, O. (eds) Applications of Declarative Programming and Knowledge Management. INAP WLP 2004 2004. Lecture Notes in Computer Science(), vol 3392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415763_12
Download citation
DOI: https://doi.org/10.1007/11415763_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25560-4
Online ISBN: 978-3-540-32124-8
eBook Packages: Computer ScienceComputer Science (R0)