Abstract
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(nlog n). This paper proposes O(nlog n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O(nlog n) implementation of fail detection (overload checking).
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, URL 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)
Brucker, P.: Complex scheduling problems (1999), URL http://citeseer.nj.nec.com/brucker99complex.html
Carlier, J., Pinson, E.: Adjustments of head and tails for the job-shop problem. European Journal of Operational Research 78, 146–161 (1994)
Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. In: Technical report, LIENS Technical Report 95-25. Ecole Normale Supérieure Paris, Françe (1995)
Nuijten, W., Foccaci, F., Laborie, P.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of the 4th International Conference on AI Planning and Scheduling, AIPS 2000, pp. 92–101 (2000)
Martin, P., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 389–403. Springer, Heidelberg (1996)
Le Pape, C., Baptiste, P., 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.: Batch processing with sequence dependent setup times: New results. In: Proceedings of the 4th Workshop of Constraint Programming for Decision and Control, CPDC 2002, Gliwice, Poland (2002)
Wolf, A.: Pruning while sweeping over task intervals. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, Springer, Heidelberg (2003)
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. (2004). O(nlog n) Filtering Algorithms for Unary Resource Constraint. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive