Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities

DOI10.1007/s10601-005-2814-0zbMath1122.90045OpenAlexW2001897285MaRDI QIDQ850453

Roman Barták, Petr Vilím, Ondřej Čepek

Publication date: 3 November 2006

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-005-2814-0

zbMATH Keywords

schedulingglobal constraintsalternativesunary resource

Mathematics Subject Classification ID

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

Related Items (1)

Allocation and scheduling of conditional task graphs

Cites Work

• Adjustment of heads and tails for the job-shop problem
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• On not-first/not-last conditions in disjunctive scheduling
• Dynamic global constraints in backtracking based environments
• Principles and Practice of Constraint Programming – CP 2003
• Unnamed Item

This page was built for publication: Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities