An efficient polynomial time approximation scheme for load balancing on uniformly related machines

Keyphrases

• Uniform Machines 100%
• Completion Time 100%
• Fully Polynomial Time Approximation Scheme 100%
• Load Balancing 100%
• Maximization Problem 50%
• Minimization Problem 50%
• Dynamic Programming 50%
• Natural Class 50%
• EPTAS 50%
• Balance Problem 50%
• Goal Function 50%
• Non-preemptive Scheduling 50%
• Shifting Method 50%

Mathematics

• Polynomial Time 100%
• Main Result 50%
• Minimizes 50%
• Minimization Problem 50%
• Subproblem 50%