Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Minimizing mean flow time for UET tasks
Yumei Huo
, Joseph Y.T. Leung
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
4
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimizing mean flow time for UET tasks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Mean Flow Time
100%
Unit Execution Times
100%
Makespan
66%
Precedence Constraints
66%
Worst-case Bounds
66%
Graham Algorithm
66%
Polynomial Time
33%
Tight
33%
Parallel Processors
33%
Strong NP-hardness
33%
In-tree
33%
Identical Processors
33%
Computer Science
Execution Time
100%
Precedence Constraint
100%
Arbitrary Number
100%
Polynomial Time
50%