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 filtering algorithm for unary resources is one of the most popular techniques. In this paper we propose a new O(n log n) version of the edge-finding algorithm that uses a special data structure called Θ-Λ-tree. This data structure is especially designed for “what-if” reasoning about a set of activities so we also propose to use it 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 chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
OR library, http://mscmga.ms.ic.ac.uk/info.html
Baptiste, P., Le Pape, C.: Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In: Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group (1996)
Barták, R.: Dynamic global constraints in backtracking based environments. Annals of Operations Research 118, 101–118 (2003)
Christopher Beck, J., Fox, M.S.: Scheduling alternative activities. In: AAAI/IAAI, pp. 680–687 (1999)
Carlier, J., Pinson, E.: Adjustments of head and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)
Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling (2000)
Martin, P., Shmoys, D.B.: A new approach to computing optimal schedules for the job-shop scheduling problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 389–403. Springer, Heidelberg (1996)
Le Pape Philippe Baptiste, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
Torres, P., Lopez, P.: On not-first/not-last conditions in disjunctive scheduling. European Journal of Operational Research (1999)
Vilím, P.: O(n log n) filtering algorithms for unary resource constraint. In: Proceedings of CP-AI-OR 2004, Springer, Heidelberg (2004)
Wolf, A., Schlenker, H.: Realizing the alternative resources constraint problem with single resource constraints. In: Proceedings of the INAP workshop 2004 (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vilím, P., Barták, R., Čepek, O. (2004). Unary Resource Constraint with Optional Activities. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive