Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities

Constraints

Volumn 10, Issue 4, 2005, Pages 403-425

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

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Alternatives; Global constraints; Scheduling; Unary resource

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; LINEAR PROGRAMMING; SCHEDULING;

ALTERNATIVES; GLOBAL CONSTRAINTS; UNARY RESOURCEUNARY RESOURCE CONSTRAINT;

ALGORITHMS;

EID: 27244445743     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-005-2814-0     Document Type: Conference Paper

References (16)

1. OR Library, http://mscmga.ms.ic.ao.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.
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.
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.
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. Vilim, 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. Vilim, 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.