(Enter summary)
Abstract: It is discussed, how scheduling problems can be solved in the concurrent constraint programming
language Oz. Oz is the first high-level constraint language, which offers an interface
to invent new constraints in an efficient way using C++. Its multi-paradigm features including
programmable search are unique in the field of constraint programming. Through the
interface, algorithms from Operations Research and related fields can be incorporated. The
algorithms can be combined through... (Update)
Context of citations to this paper: More
...The fact that the Oz system is still under development did not sensibly slow down research and evaluation work. As other works show (Wurtz 1997) the framework presented here still does not use all Oz features using constraints to tackle time table problems. Conclusion The...
...of constraint propagation is the same with all compared systems. Evaluations of Oz that specifically address scheduling problems are [159, 160]. Reports on successful applications of copying based search are [54, 56, 123, 52] 14.2.4 Copying This section presents and analyses...
Cited by: More
Programming Constraint Services - Schulte (2002)
(Correct)
Producing and Improving Time Tables by Means of Constraint .. - Anke, Staudte, Dilger
(Correct)
Similar documents (at the sentence level):
16.5%: Oz Scheduler: A Workbench for Scheduling Problems - Würtz
(Correct)
Active bibliography (related documents): More All
0.5: A Comparative Study of Eight Constraint Programming Languages .. - Fernandez, Hill (2000)
(Correct)
0.2: Heterogenous Scheduling and Rostering (Extended Abstract) - Sjöland, Aronsson.. (2000)
(Correct)
0.2: Coordination of Scheduling and Allocation Agents.. - Sjöland, Kreuger.. (1998)
(Correct)
Similar documents based on text: More All
0.3: A Survey on Finite Domain Programming in Oz - Würtz, Müller (1996)
(Correct)
0.2: Using Oz for College Timetabling - Henz, Würtz (1995)
(Correct)
0.2: Object-Oriented Concurrent Constraint Programming in Oz - Henz, Smolka, Würtz (1993)
(Correct)
BibTeX entry: (Update)
Wurtz, J. 1997. Constraint-Based Scheduling in Oz. http://citeseer.ist.psu.edu/581683.html More
@misc{ wurtz97constraintbased,
author = "J. Wurtz",
title = "Constraint-Based Scheduling in Oz",
text = "Wurtz, J. 1997. Constraint-Based Scheduling in Oz.",
year = "1997",
url = "citeseer.ist.psu.edu/581683.html" }
Citations (may not include all citations):
373
Constraint logic programming - a survey
- Jaffar, Maher - 1994
271
The Oz programming model
- Smolka - 1995
267
The constraint logic programming language CHIP (context) - Dincbas, Van Hentenryck et al. - 1988
112
A computational study of the job-shop scheduling problem (context) - Applegate, Cook - 1991
83
An algorithm for solving the job-shop problem (context) - Carlier, Pinson - 1989
65
Improved CLP scheduling with task intervals
- Caseau, Laburthe - 1994
41
A new approach to computing optimal schedules for the job sh..
- Martin, Shmoys - 1996
37
Encapsulated search and constraint programming in Oz
- Schulte, Smolka et al. - 1994
14
Deutsches Forschungszentrum fur Kunstliche Intelligenz GmbH (context) - Smolka, Treinen et al. - 1995
9
Oz Scheduler: A workbench for scheduling problems (context) - Wurtz - 1996
5
Constraint-based time tabling -- a case study (context) - Henz, Wurtz - 1996
2
Interfacing propagators with a concurrent constraint languag.. (context) - Muller, Wurtz - 1996
1
Ilog Schedule (context) - URL, www et al. - 1995
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999)
(Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura
(Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (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