Timetable edge finding filtering algorithm for discrete cumulative resources

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

Volumn 6697 LNCS, Issue , 2011, Pages 230-245

  Vilím, Petr ^a  

^a Voice Technologies and Systems   (Czech Republic)

Author keywords

Constraint Programming; Discrete Cumulative Resource; Propagation; Scheduling

Indexed keywords

BACKTRACK FREE; CONSTRAINT PROGRAMMING; DISCRETE CUMULATIVE RESOURCE; FILTERING ALGORITHM; FINDING ALGORITHM; FIXPOINTS; LOWER BOUNDS; PROPAGATION; REASONING ALGORITHMS; SCHEDULING DOMAIN; TIME COMPLEXITY; TIMETABLING;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; DATA STRUCTURES; OPTIMIZATION; SIGNAL FILTERING AND PREDICTION; SCHEDULING; WAVE PROPAGATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 79956304731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21311-3_22     Document Type: Conference Paper

References (11)

1. Project scheduling problem library, http://webserver.wi.tum.de/psplib
2. Apt, K. R.: The essence of constraint propagation. Theoretical Computer Science 221 (1-2), 179-210 (1999) (Pubitemid 129608966)
3. Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 81-89. AAAI, Menlo Park (2005)
4. Laborie, P.: Complete MCS-based search: Application to resource constrained project scheduling. In: Kaelbling, L. P., Saffiotti, A. (eds.) IJCAI, pp. 181-186. Professional Book Center (2005)
5. Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. Informs Journal of Computing 20, 143-153 (2008)
6. Pape, C. L., Baptiste, P., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
7. 3 log n). In: 16th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2005, pp. 66-80. Springer, Heidelberg (2005)
8. Schutt, A., Feydy, T., Stuckey, P. J., Wallace, M. G.: Why cumulative decomposition is not as bad as it sounds. In: Gent, I. P. (ed.) CP 2009. LNCS, vol. 5732, pp. 746-761. Springer, Heidelberg (2009)
9. Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Explaining the cumulative propagator. Constraints, 1-33-33 (2010), doi:10.1007/s10601-010-9103- 2, ISSN 1383-7133
10. Torres, P., Lopez, P.: On not-first/not-last conditions in disjunctive scheduling. European Journal of Operational Research 127(2), 332-343 (1999)
11. Vilím, P.: Edge finding filtering algorithm for discrete cumulative resources in O (kn log n). In: Gent, I. P. (ed.) CP 2009. LNCS, vol. 5732, pp. 802-816. Springer, Heidelberg (2009