Global constraints for partial CSPs: A case-study of resource and due date constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1520, Issue , 1998, Pages 87-101

  Baptiste, Philippe ^a,b   Le Pape, Claude ^b   Peridy, Laurent ^c  

^a CNRS   (France)

^b Bouygues Telecom   (France)

^c UNIVERSITÉ CATHOLIQUE DE L'OUEST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPERATIONS RESEARCH; SCHEDULING ALGORITHMS;

DOMINANCE CRITERIA; GLOBAL CONSTRAINTS; MINIMIZING THE NUMBER OF; OVERLOAD RATIO; PARTIAL CONSTRAINT SATISFACTION; PROCESSING TIME; RESOURCE CONSTRAINT; SINGLE- MACHINES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 33751502041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_8     Document Type: Conference Paper

References (21)

1. A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modeling 17:57-73.
2. D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149-156.
3. Ph. Baptiste and C. Le Pape [1995], A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling, Proc. 14th International Joint Conference on Artificial Intelligence.
4. Ph. Baptiste [1998], An O(n4) Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Technical Report 98/98, Université de Technologie de Compiègne.
5. S. Bistarelli, U. Montanari and F. Rossi [1995], Constraint Solving over Semirings, Proc. 14th International Joint Conference on Artificial Intelligence.
6. P. Brucker [1995], Scheduling algorithms, Springer Lehrbuch.
7. J. Carlier [1982], The One-Machine Sequencing Problem, European Journal of Operational Research 11:42-47.
8. J. Carlier and E. Pinson [1990], A Practical Use of Jackson’s Preemptive Schedule for Solving the Job-Shop Problem, Annals of Operations Research 26:269-287.
9. Y. Caseau and F. Laburthe [1995], Disjunctive Scheduling with Task Intervals, Technical Report, Ecole Normale Supérieure.
10. Y. Caseau and F. Laburthe [1996], CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving, Working Paper, Bouygues, Direction
11. Scientifique. S. Dauzère-Pérès [1995], Minimizing Late Jobs in the General One Machine Scheduling Problem, European Journal of Operational Research 81:134-142.
12. E. Freuder and R. Wallace [1992], Partial Constraint Satisfaction, Artificial Intelligence 58:21-70.
13. M. R. Garey and D. S. Johnson [1979], Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company.
14. H. Kise, T. Ibaraki and H. Mine [1978], A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times, Operations Research 26(1):121-126.
15. E. L. Lawler [1990], A Dynamic Programming Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Annals of Operations Research 26:125-133.
16. C. Le Pape and Ph. Baptiste [1997], A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling, Proc. 3rd International Conference on the Practical Application of Constraint Technology.
17. J. M. Moore [1968], An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1):102-109.
18. W. P. M. Nuijten [1994], Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology.
19. L. Péridy [1996], Le problème de job-shop: arbitrages et ajustements, PhD Thesis, Université de Technologie de Compiègne, France (in French).
20. J-C. Régin and J-F. Puget [1997], A Filtering Algorithm for Global Sequencing Constraints, Proc. 3rd International Conference on Principles and Practice of Constraint Programming.
21. T. Schiex, H. Fargier and G. Verfaillie [1995], Valued Constraint Satisfaction Problems: Hard and Easy Problems, Proc. 14th International Joint Conference on Artificial Intelligence.