A Constraint Model for State Transitions in Disjunctive Resources

DOI10.1007/978-3-540-73817-6_3MaRDI QIDQ3608443zbMATH OpenOpenAlexFDO

Authors Roman Bartak, Ondřej Čepek

Publication date 5 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73817-6_3

zbMATH Keywords

constraintstate transitiondisjunctive resourcedomain filtering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
• Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 1175395
• Filtering algorithms for the unary resource constraint

Cited in

(2)

• Allocation and scheduling of conditional task graphs
• scientific article; zbMATH DE number 1124540 (Why is no real title available?)

This page was built for publication: A Constraint Model for State Transitions in Disjunctive Resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608443)