# hub.solver.pile_policy_scheduling.pile_policy

Domain specification

Domain

# GreedyChoice

Enumeration representing different greedy method to use in PilePolicy

# FASTEST GreedyChoice

Schedule first the task that has the lowest duration

# MOST_SUCCESSORS GreedyChoice

Start first the tasks that have the most successors in the precedence graph

# SAMPLE_MOST_SUCCESSORS GreedyChoice

Sample next task to schedule based on a probability weight proportional to its number of successors in the precedence graph

# TOTALLY_RANDOM GreedyChoice

Sample random next task to schedule next