Stella C. S. Porto

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Celso C. Ribeiro

> Home > Persons > Stella C. S. Porto

Publications

2000
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/pc/PortoKR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/PortoKR00
Stella C. S. Porto, Joao Paulo Kitajima, Celso C. Ribeiro:
Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Comput. 26(1): 73-90 (2000)
1999
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/rairo/MaculanPRS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/MaculanPRS99
Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. RAIRO Oper. Res. 33(1): 87-92 (1999)
1996
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/heuristics/PortoR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/PortoR96
Stella C. S. Porto, Celso C. Ribeiro:
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J. Heuristics 1(2): 207-223 (1996)
1995
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ijhsc/PortoR95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhsc/PortoR95
Stella C. S. Porto, Celso C. Ribeiro:
A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. Int. J. High Speed Comput. 7(1): 45-71 (1995)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.