See this document in CiteSeerX!

Cumulative Scheduling with Task Intervals (1994)  (Make Corrections)  (28 citations)
Yves Caseau, François Laburthe
Joint International Conference and Symposium on Logic Programming



  Home/Search   Context   Related

 
View or download:
ens.fr/~laburthe/papers...jicslp96.ps.Z
dmi.ens.fr/~laburthe/pa...jicslp96.ps.Z
dmi.ens.fr/users/laburt...jicslp96.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ens.fr/~laburthe/papers (more)
From:  dmi.ens.fr/~laburthe/papers
(Enter author homepages)

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

Abstract: This paper presents a set of propagation rules to solve cumulative constraints. As in our previous paper on jobshop scheduling [8], our goal is to propose to the CLP community techniques that allow a constraint satisfaction program to obtain performances which are competitive with ad-hoc approaches. The rules that we propose are a mix of an extension of the concept of task intervals to the cumulative case and the use of a traditional resource histogram. We also explain how to use a branching... (Update)

Cited by:   More
Agent-Based Virtual Organisations for the Grid - Jigar Patel Luke   (Correct)
A Branch-and-Bound Algorithm for the.. - Dorndorf, Pesch..   (Correct)
Commitment Management through Constraint Reification - Chalmers, Preece, Norman, Gray (2004)   (Correct)

Active bibliography (related documents):   More   All
0.4:   Characterization and Generation of a General Class of.. - Kolisch, Sprecher, Drexl (1992)   (Correct)
0.3:   An Integrated Survey of Project Scheduling - Kolisch, Padman (1997)   (Correct)
0.3:   Planning and Scheduling of Nuclear Power Plant Outages - Gomes (1995)   (Correct)

Similar documents based on text:   More   All
0.5:   Application of Multi-Agent Cooperative Search to the Job-Shop .. - Bradwell, Brown (1997)   (Correct)
0.4:   Heuristics for Job-Shop Scheduling - Pasch (1997)   (Correct)
0.4:   Better Approximation Guarantees for Job-Shop Scheduling - Goldberg, Paterson.. (1996)   (Correct)

Related documents from co-citation:   More   All
16:   Improved CLP Scheduling with Tasks Intervals - Caseau, Laburthe - 1994
11:   A Theoretical and Experimental Comparison of Constraint Propagation Techniques f.. - Ph - 1995
11:   Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach (context) - Nuijten - 1994

BibTeX entry:   (Update)

Y. Caseau, F. Laburthe. Cumulative Scheduling with Task Intervals. Proc. of the 11th International Conference on Logic Programming, The MIT Press, 1994. http://citeseer.ist.psu.edu/caseau94cumulative.html   More

@inproceedings{ caseau96cumulative,
    author = "Yves Caseau and Francois Laburthe",
    title = "Cumulative Scheduling with Task Intervals",
    booktitle = "Joint International Conference and Symposium on Logic Programming",
    pages = "363-377",
    year = "1996",
    url = "citeseer.ist.psu.edu/caseau94cumulative.html" }
Citations (may not include all citations):
271   The Oz Programming Model - Smolka - 1995
65   Improved CLP Scheduling with Tasks Intervals - Caseau, Laburthe - 1994
61   Extending CHIP in order to Solve Complex Scheduling and Plac.. (context) - Aggoun, Beldiceanu - 1993
45   Adjustments of Heads and Tails for the Job-Shop Problem (context) - Carlier, Pinson - 1994
41   A New Approach to Computing Optimal Schedules for the Job Sh.. - Martin, Shmoys - 1996
30   Implementation of Resource Constraints in ILOG SCHEDULE: A L.. (context) - Le Pape - 1994
26   New Benchmark Results for the Resource Constrained Project S.. (context) - Demeulemeester, Herroelen - 1995
20   Heuristic Algorithms for Resource-Constrained Project Schedu.. (context) - Alvarez-Valdes, Tamarit - 1989
19   Project Scheduling with Resource Constraints: a Branch and B.. (context) - Christofides, Almarez-Valdes et al. - 1987
11   Improving Branch and Bound for Jobshop Scheduling with Const.. - Caseau, Laburthe - 1995
10   Constraint Satisfaction with an Object-Oriented Knowledge Re.. - Caseau - 1994
7   Optimal Algorithms for Various Classes of Multiple Resource .. (context) - Demeulemeester
4   A Branch and Bound Algorithm for a General Class of Multiple.. (context) - Stinson
3   A Comparison of Exact Procedures for solving the Multiple Co.. (context) - Patterson - 1984
1   Jackson's Pseudo Preemptive Schedule for the Pm/r (context) - Carlier, Pinson - 1996
1   Optimizing the cumulative constraint by global capacity cons.. (context) - Lock - 1996
1   An Exact Algorithm for Project Scehduling with Resource Cons.. (context) - Mingozzi, Maniezzo et al. - 1994
1   a constraint satisfaction approach (context) - Nuijten, Resource - 1994
1   A Computational study of the Job-Shop Problem ORSA Jouranl o.. (context) - Applegate, Cook - 1991
1   solus de recherche opérationelle (context) - et, re - 1985
1   thode Arborescente pour résoudre les problèmes cumulatifs (context) - Carlier, Latapie - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.ens.fr/~laburthe/papers.html):   More
Improving Branch and Bound for Jobshop Scheduling with.. - Caseau, Laburthe (1995)   (Correct)
A Deductive and Object-Oriented Approach to a Complex.. - Caseau, Guillo, Levenez (1994)   (Correct)
The Hilbert Basis of the Cut Cone over the Complete Graph .. - Laburthe, Deza, Laurent (1995)   (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