Table 1. Mixed integer linear program for Snakemake’s scheduling problem.
Objective:
|
Variables:
binary ( x j) j∈ J : do we schedule job j ∈ J? binary ( γ f) f∈ F : can we delete file f ∈ F? continuous ( δ f) f∈ F ∈ [0, 1]: lifetime fraction of f ; see ( 3) Parameters: p j ∈ ℕ : priority of job j ∈ J u r,j ∈ ℕ : j’s usage of resource r z f,j : does job j ∈ J o need file f ? U r ∈ ℕ : free capacity of resource r S f ∈ ℕ : size of file f S ∈ ℕ : sum of file sizes |