A new formulation for scheduling unrelated processor under precedence constraints

A new formulation for scheduling unrelated processor under precedence constraints

0.00 Avg rating0 Votes
Article ID: iaor20001546
Country: France
Volume: 33
Issue: 1
Start Page Number: 87
End Page Number: 92
Publication Date: Jan 1999
Journal: RAIRO Operations Research
Authors: , , ,
Keywords: computational analysis: parallel computers
Abstract:

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.

Reviews

Required fields are marked *. Your email address will not be published.