A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling

@inproceedings{Baptiste1995ATA,
  title={A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling},
  author={Philippe Baptiste and Claude Le Pape},
  booktitle={IJCAI},
  year={1995}
}
Disjunctive constraints are widely used to ensure that the time intervals over which two activities require the same resource cannot overlap: if a resource is required by two activities A and B, the disjunctive constraint states that either A precedes B or B precedes A. The \propagation" of disjunctive constraints consists in determining cases where only one of the two orderings is feasible. It results in updating the time-bounds of the two activities. The standard algorithm for propagating… CONTINUE READING
55 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 55 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Constraint-Based Scheduling: Two Extensions

  • Baptiste, 1994 Philippe Baptiste
  • MSc Thesis, University of Strathclyde,
  • 1994

and Fran  cois Laburthe . Improved CLP Scheduling with Task Intervals

  • Yves Caseau
  • 1994

Job-Shop Scheduling by Constraint Satisfaction

  • Nuijten et al, 1993b W.P.M. Nuijten, E.H.L. Aarts, D.A.A. van Erp Taalman Kip, K. M. van Hee
  • 1993

Randomized Constraint Satisfaction for Job-Shop Scheduling

  • Nuijten et al, 1993a W.P.M. Nuijten, E.H.L. Aarts, D.A.A. van Erp Taalman Kip, K. M. van Hee
  • Proceedings of the AAAI-SIGMAN
  • 1993

A Computational Study of the Job-Shop Scheduling Problem

  • Applegate, Cook, 1991 David Applegate, William Cook
  • ORSA Journal on Computing,
  • 1991

Similar Papers

Loading similar papers…