A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine

Keyphrases

• Resource Consumption 100%
• Single Machine 100%
• Bi-criteria 100%
• Number of Tardy Jobs 100%
• Resource Consumption Function 66%
• NP-hard 33%
• Polynomial-time Algorithm 33%
• Specific Types 33%
• Processing Time 33%
• Heuristic Algorithms 33%
• Contrastive Analysis 33%
• Processing Operations 33%
• Scheduling Problem 33%
• General Type 33%
• Continuous Resource 33%
• Job Processing 33%
• Non-renewable Resources 33%
• Total Resources 33%
• Convex Resource Consumption Function 33%
• Resource-dependent Processing Times 33%
• Trade-off Curve 33%
• Job Resources 33%
• Robustness Analysis 33%
• Controllable Resources 33%

Mathematics

• Minimizes 100%
• Single Machine 100%
• Bicriteria 100%
• Consumption Function 100%
• Polynomial Time 33%
• Wide Range 33%
• Tradeoff 33%
• Heuristic Algorithm 33%

Computer Science

• Resource Consumption 100%
• Single Machine 100%
• Processing Time 40%
• Polynomial Time Algorithm 20%
• Heuristic Algorithm 20%
• Scheduling Problem 20%