Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research units
Research output
Search by expertise, name or affiliation
Robust algorithms for total completion time
Leah Epstein
, Asaf Levin
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Robust algorithms for total completion time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Migration Factor
100%
Robust Algorithm
100%
Total Completion Time
100%
Identical Machines
75%
Uniform Machines
50%
Almost Optimal
50%
Optimal Assignment
50%
Approximation Scheme
25%
Online Problem
25%
Online Algorithms
25%
Fully Polynomial Time Approximation Scheme
25%
Nearly Optimal
25%
Optimal Schedule
25%
One-at-a-time
25%
Unrelated Machines
25%
Polynomially Solvable
25%
Optimal Order
25%
Mathematics
Robust Algorithm
100%
Optimal Assignment
100%
Running Time
50%
Minimizes
50%
Fully Polynomial-Time Approximation Scheme
50%
Time Slot
50%
Computer Science
Completion Time
100%
Optimal Assignment
100%
on-line algorithm
50%
Fully Polynomial-Time Approximation Scheme
50%
approximation scheme
50%
Term Assignment
50%