Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection

Keyphrases

• Medium Size 100%
• Job Rejection 100%
• Pseudo-polynomial 100%
• Polynomial Dynamics 100%
• Dynamic Programming Algorithm 100%
• Parallel Machines 100%
• Scheduling Problem 50%
• NP-hard 50%
• Rejection Cost 50%
• Due Date 50%
• Scheduler 50%
• Processing Time 50%
• Job Processing 50%
• NP-hard Problem 50%
• Machine Settings 50%
• Parallel Identical Machines 50%
• Job-dependent 50%
• Due Window 50%
• Solution Procedure 50%
• Integer Linear Programming Formulations 50%

Computer Science

• Dynamic Programming Algorithm 100%
• Parallel Machine 100%
• Scheduling Problem 50%
• Processing Time 50%
• Objective Function 50%
• Solution Procedure 50%
• Integer-Linear Programming 50%

Mathematics

• Polynomial 100%
• Running Time 50%
• Integer 50%
• Objective Function 50%
• Numerical Analysis 50%
• NP-hard Problem 50%
• Linear Programming 50%