A constraint model for state transitions in disjunctive resources

Authors:
Roman Barták;Ondřej Čepek
Affiliations:
Charles University in Prague, Faculty of Mathematics and Physics, Praha 1, Czech Republic;Charles University in Prague, Faculty of Mathematics and Physics, Praha 1, Czech Republic and Institute of Finance and Administration, Praha 10, Czech Republic
Venue:
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Year:
2006

Citing 8
Cited 0

Backtracking algorithms for disjunctions of temporal constraints

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Scheduling alternative activities

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Constraint-Based Scheduling

Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
A Time and Resource Problem for Planning Architectures

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Augmenting disjunctive temporal problems with finite-domain constraints

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Resource temporal networks: definition and complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional resources in scheduling are simple machines where the limited capacity is the main restriction. However, in practice there frequently appear resources with more complex behaviour that is described using state transition diagrams. This paper presents new filtering rules for constraints modelling the state transition diagrams. These rules are based on the idea of extending traditional precedence graphs by direct precedence relations. The proposed model also assumes optional activities and it can be used as an open model accepting new activities during the solving process.