O(n log n) filtering algorithms for unary resource constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3011, Issue , 2004, Pages 335-347

  Vilím, Petr ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; SIGNAL FILTERING AND PREDICTION;

FILTERING ALGORITHM; TIME COMPLEXITY; UNARY RESOURCE CONSTRAINT;

ALGORITHMS;

EID: 35048841193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_23     Document Type: Article

References (11)

1. OR library. URL http://mscmga.ms.ic.ac.uk/info.html.
2. Philippe Baptiste and Claude Le Pape. 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.
3. Peter Brucker. Complex scheduling problems, 1999. URL http://citeseer.nj.nec.com/brucker99complex.html.
4. Jacques Carlier and Eric Pinson. Adjustments of head and tails for the job-shop problem. European Journal of Operational Research, 78:146-161, 1994.
5. Yves Caseau and Francois Laburthe. Disjunctive scheduling with task intervals. In Technical report, LIENS Technical Report 95-25. Ecole Normale Supérieure Paris, France, 1995.
6. W. Nuijten, F. Foccaci, P. Laborie. Solving scheduling problems with setup times and alternative resources. In Proceedings of the 4th International Conference on AI Planning and Scheduling, AIPS'00, pages 92-101, 2000.
7. Paul Martin and David B. Shmoys. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. In W. H. Cunningham, S. T. McCormick, and M. Queyranne, editors, Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, IPCO'96, pages 389-403, Vancouver, British Columbia, Canada, 1996.
8. Claude Le Pape, Philippe Baptiste and Wim Nuijten. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, 2001.
9. Philippe Torres and Pierre Lopez. On not-first/not-last conditions in disjunctive scheduling. European Journal of Operational Research, 1999.
10. Petr Vilím. 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, 2002.
11. Armin Wolf. Pruning while sweeping over task intervals. In Principles and Practice of Constraint Programming - CP 2003, Kinsale, Ireland, 2003.