A unified approach for scheduling with convex resource consumption functions using positional penalties

Keyphrases

• Unified Approach 100%
• Due Date Assignment 100%
• Convex Resource Consumption Function 100%
• Positional Penalties 100%
• Unified Model 80%
• Assignment Problem 40%
• Scheduling Problem 40%
• Makespan 40%
• Total Resources 40%
• Polynomial Time 20%
• Fast Algorithm 20%
• Resource Consumption 20%
• Weighted number of Tardy Jobs 20%
• Single Machine Scheduling Problem 20%
• Resource Consumption Cost 20%
• Controllable Processing Times 20%
• Earliness-tardiness 20%

Computer Science

• Assignment Problem 100%
• Objective Function 100%
• Scheduling Problem 100%
• Resource Consumption 100%
• Polynomial Time 50%
• Processing Time 50%
• Fast Algorithm 50%
• single machine scheduling problem 50%
• Resource Consumption Cost 50%

Mathematics

• Objective Function 100%
• Minimizes 100%
• Consumption Function 100%
• Polynomial Time 50%
• Fast Algorithm 50%
• Single Machine 50%