POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization.
Pascal BercherConny OlzPublished in: AAAI (2020)
Keyphrases
- partial order
- temporal planning
- causal links
- partially ordered
- temporal planner
- total order
- makespan minimization
- mutual exclusion
- constraint programming
- processing times
- computational complexity
- domain independent
- worst case
- job shop scheduling problem
- single machine
- special case
- ai planning
- decision problems
- heuristic search
- planning problems
- bayesian networks
- causal relationships
- parallel machines
- plan generation
- temporal constraints
- long distance
- precedence constraints
- causal models
- sequential patterns
- scheduling problem
- np hard
- search space
- search algorithm