Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine

Computer Science

• Processing Time 100%
• Single Machine 100%
• Assignment Method 100%
• Resource Allocation 100%
• polynomial-time algorithm 50%
• Objective Function 50%
• Supply Chain 50%
• single machine scheduling problem 50%
• Effective Management 50%
• Convex Function 50%
• Resource Consumption Cost 50%

Mathematics

• Minimizes 100%
• Single Machine 100%
• Polynomial Time 50%
• Objective Function 50%
• Linear Function 50%
• Convex Function 50%

Keyphrases

• Controllable Job Processing Time 20%
• Earliness Penalty 20%
• Divisible Resource 20%