IMPROVED OPTIMAL-ALGORITHMS FOR SCHEDULING UNIT-LENGTH INDEPENDENT TASKS ON UNIFORM MACHINES

 
This item is provided by the institution :

Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA
see the original item page
in the repository's web site and access all digital files if the item*
share



Semantic enrichment by EKT
Journal part (EN)
Scientific article (EN)
1994 (EN)
IMPROVED OPTIMAL-ALGORITHMS FOR SCHEDULING UNIT-LENGTH INDEPENDENT TASKS ON UNIFORM MACHINES (EN)
TZAFESTAS, S (EN)
TRIANTAFYLLAKIS, A (EN)
Five scheduling problems are considered, concerning unit-length independent tasks and uniform machines. New improved optimal algorithms are presented that can solve these problems in at most O(n log n) time, where n is the number of tasks. The existing algorithms solve most of these problems in O(n3) time. Proofs of optimality of the present algorithms are included, and simple representative examples are provided that illustrate the type of results obtained. (EN)
journalArticle (EN)
Operations Research & Management Science (EN)
RESOURCE CONSTRAINTS (EN)
PROCESSORS (EN)
Optimal Algorithm (EN)
Automation & Control Systems (EN)
Computer Science, Theory & Methods (EN)
National Technical University of Athens
Digital Library of National Technical University of Athens | Dspace@NTUA
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE (EN)
English
1994 (EN)
http://hdl.handle.net/123456789/11246
10.1080/00207729408928982 (EN)
25 (EN)
3 (EN)
601 (EN)
591 (EN)
ISI:A1994NE64400014 (EN)
0020-7721 (EN)
TAYLOR & FRANCIS LTD (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)