Report - ROADEF 2009roadef2009.loria.fr/programme/Articles.pdf · – Precedence graph G(V,E) where : – V = {T i}1≤i≤n is a set of n tasks with unit processing time. To each task T i

Please pass captcha verification before submit form