Výsledky vyhledávání - "Non- numerical Algorithms and Problems—Sequencing and scheduling"

Minimizing Total Completion Time on Uniform Machines with Deadline Constraints

Autoři: Teofilo F. Gonzalez Joseph Y. -t. Leung Michael Pinedo a další

Přispěvatelé: Teofilo F. Gonzalez Joseph Y. -t. Leung Michael Pinedo a další

Zdroj: http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory, Performance Additional Key Words and Phrases, Mean flow time, uniform machines, deadline constraints, polynomial-time algorithms

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.7075; http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.7075
http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf