Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
Chandra Chekuri
, Michael Bender
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Uniform Machines
100%
Approximation Ratio
100%
Makespan Minimization
100%
Efficient Approximation Algorithm
100%
Processing Requirements
50%
Processing Time
50%
New Approximation
50%
Partial Order
50%
Processing Machines
50%
Precedence-constrained Jobs
50%
Non-preemptive
50%
Preemptive Scheduling
50%
Combinatorial Algorithms
50%
Precedence Constraints
50%
Linear Programming Relaxation
50%
Discrete Algorithm
50%
Makespan
50%
Mathematics
Minimizes
100%
Partial Order
100%
Unit Time
100%
Linear Programming Relaxation
100%
Combinatorial Algorithm
100%
Computer Science
Approximation Algorithms
100%
Approximation Ratio
100%
Processing Time
50%
Linear Programming
50%
Partial Order
50%
Precedence Constraint
50%