See this document in CiteSeerX!

Constraint Propagation Techniques for Cumulative Scheduling (1998)  (Make Corrections)  (1 citation)
Philippe Baptiste, Claude Le Pape



  Home/Search   Context   Related

 
View or download:
deis.unibo.it/Events/Paper...10final.ps
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  deis.unibo.it/Event...Proceedings (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In recent years, constraint satisfaction techniques have been successfully applied to "disjunctive" scheduling problems, i.e., scheduling problems where each resource can execute at most one activity at a time. Less significant and less generally applicable results have been obtained in the area of "cumulative" scheduling, where several activities can execute in parallel. This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative... (Update)

Similar documents based on text:   More   All
0.2:   A Constraint-Based Branch-and-Bound Algorithm for Preemptive .. - Baptiste, Le Pape (1996)   (Correct)
0.2:   An Experimental Comparison of Constraint-Based Algorithms.. - Le Pape, Baptiste (1997)   (Correct)
0.2:   Constraint-Based Optimization and Approximation for.. - Baptiste, Le Pape.. (1995)   (Correct)

BibTeX entry:   (Update)

P. Baptiste and C. Le Pape. Constraint Propagation Techniques for Cumulative Scheduling. In Proceedings of the First Workshop on the Integration of AI and OR Thechniques in Constraint Programming for Combinatorial Optimization Problems, Ferrara, Italy, 1999. http://citeseer.ist.psu.edu/baptiste98constraint.html   More

@misc{ baptiste99constraint,
  author = "P. Baptiste and C. Le Pape",
  title = "Constraint Propagation Techniques for Cumulative Scheduling",
  text = "P. Baptiste and C. Le Pape. Constraint Propagation Techniques for Cumulative
    Scheduling. In Proceedings of the First Workshop on the Integration of AI
    and OR Thechniques in Constraint Programming for Combinatorial Optimization
    Problems, Ferrara, Italy, 1999.",
  year = "1999",
  url = "citeseer.ist.psu.edu/baptiste98constraint.html" }
Citations (may not include all citations):
3   Resource Constraints for Preemptive Job-Shop Scheduling (context) - Le Pape, Baptiste - 1998
3   Ordonnancement de taches sous contraintes : une approche 'en.. (context) - Lopez, Erschler et al. - 1992
1   Claude Le Pape and Wim Nuijten Satisfiability Tests and Time.. (context) - Baptiste - 1997
1   Jackson Pseudo Preemptive Schedule (context) - Carlier, Pinson - 1996

Documents on the same site (http://www.deis.unibo.it/Events/Proceedings.html):   More
An Integrated Constraint-Based Model For Task Scheduling And.. - Huguet, Lopez   (Correct)
A Constraint Logic Programming Variant of Augmenting Path.. - Cristina Fierbinteanu   (Correct)
Constraint Programming Based Column Generation for Crew.. - Junker, Karisch, Kohl.. (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC