Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073919
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:05:23 PM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Thursday, March 24, 2011 - 1:21:13 PM

Identifiers

  • HAL Id : inria-00073919, version 1

Collections

Citation

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

Share

Metrics

Record views

181

Files downloads

113