A job allocation algorithm for parallel processors
We are given a nite set of jobs of equal processing times with readiness times and tails and a set of identical processors. The aim is to schedule the given set of jobs on the given set of processors to minimize the total processing time (or makespan). An algorithm for that problem with the time co...
Guardado en:
| Autor principal: | Vakhania, Nodari |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
1997
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23931 |
| Aporte de: |
Ejemplares similares
-
Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003) -
Parallelization of ARTUR algorithm using PVM
por: Fernandez, G.J., et al. -
Parallelization of ARTUR algorithm using PVM
por: Jacobo Berlles, Julio C. A., et al.
Publicado: (2000) -
Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001) -
A comparison between centralized and decentralized genetic algorithms for the identical parallel machines scheduling
por: Esquivel, Susana Cecilia
Publicado: (2006)