| Issue |
RAIRO-Oper. Res.
Volume 33, Number 1, January-March 1999
|
|
|---|---|---|
| Page(s) | 87 - 92 | |
| DOI | https://doi.org/10.1051/ro:1999106 | |
| Published online | 15 August 2002 | |
A new formulation for scheduling unrelated processor under precedence constraints
1
Universidade Federal do Rio de Janeiro COPPE - Engenharia de Sistemas
e Computaçao Caixa Postal 68511, Rio de Janeiro 21945-970 Brazil,
e-mail: maculan@cos.ufrj.br
2
Universidade Federal Fluminense Dept. of Telecommunication Engineering
Rua Passos da Pátria 156, Niterói 24210, Brazil, e-mail: stella@caa.uff.br
3
Pontifícia Universidade Católica Departamento de Informática Rua
Marquès de São Vicente 225, Rio de Janeiro 22453-900, Brazil,
e-mail: celso@inf.puc.rio.br
4
Universidade Estadual de Campinas Departamento de Ciência de
Computação Caixa Postal 6065, Campinas 13081, Brazil,
e-mail: cid@dcc.unicamp.br
Received:
September
1996
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.
Résumé
Nous donnons ici une formulation nouvelle du problème de l'ordonnancement des tâches utilisant des processeurs indépendants sous contraintes de cette formulation à un nombre polynomial de variables et n'exige pas que les temps de traitement aient des valeurs entières.
Key words: Parallel processing / scheduling / unrelated processors / precedence constraints / makespan.
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.