Minimizing maximum late work with optional job rejection on a single machine

Keyphrases

• Dynamic Programming 100%
• NP-hard 100%
• Single Machine 100%
• Job Rejection 100%
• Late Work 100%
• Popular 50%
• Optimal Schedule 50%
• Pseudo-polynomial 50%
• Polynomial Dynamics 50%
• Pareto Optimal Frontier 50%

Mathematics

• Single Machine 100%
• Dynamic Programming 100%
• Polynomial 50%
• Numerical Analysis 50%
• Pareto Optimal 50%

Computer Science

• Dynamic Programming 100%
• Single Machine 100%
• Numerical Analysis 50%