-
41
pages
-
English
-
Documents
Description
„…„…„……Constraint Satisfactionfor Planning & SchedulingRoman BartákCharles University, Prague (CZ)roman.bartak@mff.cuni.czWhat?What is the topic of the tutorial?constraint satisfaction techniques useful for P&SWhat is constraint satisfaction?technology for modeling and solving combinatorial optimization problemsWhat is the difference from AIPS02 tutorial?focus on constraint satisfaction in generalmore explanations but less broadConstraint Satisfaction for Planning and Scheduling 21……„„„……„……„………………Why?Why you should look at constraint satisfaction?powerful solving technology planning and scheduling are coming together and constraint satisfaction may serve as bridgeWhy you should understand insides of constraint satisfaction algorithms?better exploitation of the technologydesign of better (solvable) constraint modelsConstraint Satisfaction for Planning and Scheduling 3Tutorial outlineConstraint satisfaction in a nutshelldomain filtering and local consistenciessearch techniquesextensions of a basic constraint satisfaction problemConstraints for planning and schedulingconstraint models for planning and schedulingspecial filtering algorithms (global constraints) for P&Sbranching schemes for planning and schedulingConclusionsa short survey on constraint solverssummaryConstraint Satisfaction for Planning and Scheduling 42……………Constraint satisfactionin a nutshellConstraint technologybased on declarative ...
-
Publié par
-
Langue
English