Fast approximation algorithms for bi-criteria scheduling with machine assignment costs

Keyphrases

• Makespan 100%
• Total Completion Time 100%
• Bicriteria Scheduling 100%
• Machine Assignment 100%
• Fast Approximation Algorithms 100%
• Machine Cost 100%
• Scheduling Problem 50%
• Strong NP-hardness 50%
• Performance Bounds 50%
• Parallel Machine Scheduling Problem 50%
• Scheduling Theory 50%
• Worst-case Performance 50%
• Fast Heuristic 50%

Mathematics

• Minimizes 100%
• Objective Function 50%
• Worst Case 50%
• Scheduling Theory 50%

Engineering

• Machine Cost 100%
• Objective Function 50%