Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling

@inproceedings{Baptiste1996EdgeFindingCP,
  title={Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cumulative Scheduling},
  author={Philippe Baptiste and Claude Le Pape},
  year={1996}
}
Edge-finding bounding techniques are particular constraint propagation techniques which reason about the order in which several activities can execute on a given resource. T h aim of the following paper is to provide a rather comprehensive (although necessarily incomplete) review of existing edge-fi nding algorithms. The simplest case of non-preemptive disjunctive scheduling is reviewed first, followed by generalizations to preemptive disjunctive and non-preemptive cumulative scheduling. A new… CONTINUE READING