Cargando...
Algorithms for two scheduling problems
We describe algorithms for solving the following two scheduling problems on identical pa.rallel processors. Each job requires unit processing time, has a release date and a weight. The first problem also involves the existence of dea.dlines and consists of minimizing the weighted sum of tardy jobs....
Guardado en:
| Publicado en: | Relatório Técnico NCE |
|---|---|
| Autores principales: | , |
| Formato: | Relatório |
| Lenguaje: | Inglês |
| Publicado: |
Brasil
1992-07-30
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/11422/1077 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|