Scheduling with two competing agents to minimize total weighted earliness

Keyphrases

• Weighted Earliness 100%
• Competitive Agents 100%
• Dynamic Programming Algorithm 100%
• NP-hard 66%
• Maximum Earliness 66%
• Pseudo-polynomial 66%
• Polynomial Dynamics 66%
• Dynamic Programming 33%
• Single Machine Scheduling Problem 33%
• Efficient Heuristics 33%
• Optimal Schedule 33%
• Medium Size 33%
• Numerical Test 33%
• Earliness 33%
• NP-hardness 33%
• Optimality Gap 33%
• Complexity Classes 33%
• Inverse Problem 33%
• Multi-agent 33%

Mathematics

• Minimizes 100%
• Upper Bound 100%
• Polynomial 100%
• Ordinary Sense 100%
• Objective Function 50%
• Single Machine 50%
• Numerical Analysis 50%
• Optimality 50%

Computer Science

• Dynamic Programming Algorithm 100%
• single machine scheduling problem 33%
• multi agent 33%
• Dynamic Programming 33%
• Complexity Class 33%
• Inverse Problem 33%
• Objective Function 33%