Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

Keyphrases

• Total Weighted Completion Time 100%
• Approximation Algorithms 100%
• Agent Scheduling 100%
• Scheduling Problem 50%
• NP-hard 50%
• Single Machine 50%
• Fully Polynomial Time Approximation Scheme 50%
• Worst-case Performance 50%
• Two-agent 50%
• Efficient Approximation Algorithm 50%
• Multi-objective Shortest Path 50%
• Unweighting 50%

Mathematics

• Minimizes 100%
• Worst Case 50%
• Single Machine 50%
• Path Problem 50%
• Fully Polynomial-Time Approximation Scheme 50%
• Ordinary Sense 50%