Edge Finding for Cumulative Scheduling

References

• Baptiste P. A theoretical and computational study of resource constraint propagation. (1998) . PhD thesis, Université de Technologie de Compiègne, Compiègne, FranceGoogle Scholar
• Baptiste P., Le Pape C., Nuijten W.Constraint-Based Scheduling (2001) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Carlier J., Pinson E. Adjustment of heads and tails for the jobshop problem. Eur. J. Oper. Res. (1994) 78:146–161Crossref, Google Scholar
• Caseau Y., Laburthe F. Improving CLP scheduling with task intervals. Proc. 11th Internat. Conf. Logic Programming (ICLP'94) (1994) Santa Margherita Ligure, Italy:369–383Google Scholar
• Mercier L., Hentenryck P. V. Strong polynomiality of resource constraint propagation. Discrete Optim. (2007) . ForthcomingCrossref, Google Scholar
• Nuijten W. Time and resource constrained scheduling: A constraint satisfaction approach. (1994) . PhD thesis, Eindhoven University of Technology, Eindhoven, The NetherlandsGoogle Scholar
• Nuijten W., Aarts E. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. Eur. J. Oper. Res. (1996) 90:269–284Crossref, Google Scholar
• Vilim P., Barták R., Čepek O. Unary resource constraint with optional activities. Principles and Practice of Constraint Programming—CP 2004: 10th Internat. Conf. (2004) 3258(Springer-Verlag, Berlin) 62–76Lecture Notes in Computer ScienceCrossref, Google Scholar