On Unrelated Machine Scheduling with Precedence Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1996

On Unrelated Machine Scheduling with Precedence Constraints

Abstract

In this paper, we consider the problem of scheduling tasks on unrelated parallel machines. Precedence constraints exist between the tasks, but their number is limited compared with the number of tasks. We propose a number of heuristics in order to find near-optimal solutions to the problem. Empirical results show that the heuristics are able to find very good approximate solutions.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2773.pdf (743.3 Ko) Télécharger le fichier

Dates and versions

inria-00073919 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073919 , version 1

Cite

Jeffrey Herrmann, Jean-Marie Proth, Nathalie Sauer. On Unrelated Machine Scheduling with Precedence Constraints. [Research Report] RR-2773, INRIA. 1996, pp.22. ⟨inria-00073919⟩
75 View
68 Download

Share

Gmail Facebook X LinkedIn More