%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:38 +0100 GMT
%    
% Selection : Reference #1358
%




@InProceedings{Würtz:1996,
      AUTHOR = {Würtz, Jörg},
      TITLE = {Constraint-Based Scheduling in Oz},
      YEAR = {1996},
      BOOKTITLE = {Operations Research Proceedings 1996. Selected Papers of the Symposium on Operations Research (SOR '96), September 4-6},
      PAGES = {218-223},
      EDITOR = {Zimmermann, U. and Derigs, U. and Gaul, W. and Möhrig, R. and Schuster, K.-P.},
      ADDRESS = {Technical University Braunschweig, Germany},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintScheduling97.ps.gz},
      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 encapsulation into constraints and can communicate via shared variables. This is exemplified by the integration of new techniques based on edge-finding for job-shop and multi-capacitated scheduling. The viability of Oz as a platform for problem solving is also exemplified by a graphical scheduling workbench. The performance for job-shop problems is comparable to state-of-the-art scheduling tools.},
      ANNOTE = {COLIURL : Wurtz:1996:CBS.pdf Wurtz:1996:CBS.ps}
}