Impact-Based Search in Constraint-based Scheduling

Zusammenfassung
A novel adaptation of impact-based search strategies for constraint-based resource scheduling is presented. Search based on impacts applies a general purpose search strategy originally from Linear Integer Programming and recently adapted to Constraint Programming. To my knowledge it is shown for the first time that this strategy is properly applicable to constraint-based scheduling and performs well on the class of job-shop scheduling problems. Evidence is given empirically by comparison with a problem-specific and a random strategy.
  • Vollständige Referenz
  • BibTeX
Wolf, A., (2008). Impact-Based Search in Constraint-based Scheduling. In: Hegering, H.-G., Lehmann, A., Ohlbach, H. J. & Scheideler, C. (Hrsg.), INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2. Bonn: Gesellschaft für Informatik e. V.. (S. 523-528).
@inproceedings{mci/Wolf2008,
author = {Wolf, Armin},
title = {Impact-Based Search in Constraint-based Scheduling},
booktitle = {INFORMATIK 2008. Beherrschbare Systeme - dank Informatik. Band 2},
year = {2008},
editor = {Hegering, Heinz-Gerd AND Lehmann, Axel AND Ohlbach, Hans Jürgen AND Scheideler, Christian} ,
pages = { 523-528 },
publisher = {Gesellschaft für Informatik e. V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
523.pdf197.6Kb PDF Öffnen

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken

Mehr Information

ISBN: 978-3-88579-228-4
ISSN: 1617-5468
Datum: 2008
Sprache: en (en)
Typ: Text/Conference Paper
Sammlungen

Zur Langanzeige