Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-06-07T22:23:24.414Z Has data issue: false hasContentIssue false
  • English
  • Français

A new formulation for scheduling unrelated processor under precedence constraints

Published online by Cambridge University Press:  15 August 2002

Nelson Maculan ,
Stella C.S. Porto ,
Celso C. Ribeiro  and
Cid Carvalho de Souza
Nelson Maculan
Affiliation:
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
Stella C.S. Porto
Affiliation:
Universidade Federal Fluminense Dept. of Telecommunication Engineering Rua Passos da Pátria 156, Niterói 24210, Brazil, e-mail: stella@caa.uff.br
Celso C. Ribeiro
Affiliation:
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
Cid Carvalho de Souza
Affiliation:
Universidade Estadual de Campinas Departamento de Ciência de Computação Caixa Postal 6065, Campinas 13081, Brazil, e-mail: cid@dcc.unicamp.br
Get access

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.

Keywords

Parallel processingschedulingunrelated processorsprecedence constraintsmakespan.
Type
Research Article
Information
RAIRO - Operations Research , Volume 33 , Issue 1 , January 1999 , pp. 87 - 92
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)