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

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01272442
Contributor : Lip6 Publications <>
Submitted on : Monday, December 12, 2016 - 7:30:28 PM
Last modification on : Thursday, March 21, 2019 - 1:04:21 PM
Long-term archiving on : Tuesday, March 28, 2017 - 12:33:16 AM

File

LPPGJ.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01272442, version 1

Citation

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⟩

Share

Metrics

Record views

99

Files downloads

104