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....

Full beskrivning

Sparad:
Bibliografiska uppgifter
I publikationen:Relatório Técnico NCE
Huvudupphovsmän: Szwarcfiter, Jayme Luiz, Richa, Andréa Werneck
Materialtyp: Relatório
Språk:Inglês
Publicerad: Brasil 1992-07-30
Ämnen:
Algoritmos
Escalonamento
Algorithms
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Länkar:http://hdl.handle.net/11422/1077
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk