Equivalence of two classical list scheduling algorithms for dependent tasks with release dates and due dates on parallel processors

Claire Hanen (1, 2, 3) , Alix Munier-Kordon (4)

1 RO - Recherche Opérationnelle
2 UPN - Université Paris Nanterre
3 UPL - Université Paris Lumières
4 ALSOC - Architecture et Logiciels pour Systèmes Embarqués sur Puce

In this communication we establish that two algorithms minimizing the maximum lateness of a set of dependent tasks with release and due dates produce similar schedules: the Garey and Johnson and the Leung Palem and Pnueli algorithms.

Mots clés: scheduling; release dates; due dates; list scheduling

Domaines: Informatique [cs]

Claire Hanen, Alix Munier-Kordon. Equivalence of two classical list scheduling algorithms for dependent tasks with release dates and due dates on parallel processors. Project Management and Scheduling conference, Apr 2012, Leuwen, Belgium. ⟨hal-01272442⟩