Scheduling on parallel dedicated machines with job rejection

Keyphrases

• Scheduling Problem 100%
• Job Rejection 100%
• Makespan Minimization 100%
• Parallel Dedicated Machines 100%
• Pseudo-polynomial 50%
• Dynamic Programming Algorithm 50%
• Polynomial Dynamics 50%
• NP-hard Problem 50%
• Rejection Cost 50%
• Release Dates 50%
• Total Completion Time 50%
• Total Weighted Completion Time 50%
• Maximum Tardiness 50%

Computer Science

• Scheduling Problem 100%
• Completion Time 100%
• Dynamic Programming Algorithm 50%

Mathematics

• Polynomial 100%
• NP-hard Problem 100%