Načítá se...
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....
Uloženo v:
| Vydáno v: | Relatório Técnico NCE |
|---|---|
| Hlavní autoři: | , |
| Médium: | Relatório |
| Jazyk: | Inglês |
| Vydáno: |
Brasil
1992-07-30
|
| Témata: | |
| On-line přístup: | http://hdl.handle.net/11422/1077 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|