Single-machine scheduling with machine unavailability periods and resource dependent processing times

Keyphrases

• Single Machine Scheduling 100%
• Unavailability Period 100%
• Resource-dependent Processing Times 100%
• Processing Time 66%
• Processing Operations 66%
• NP-hard 33%
• Polynomial Approximation 33%
• Feasible Solution 33%
• Makespan 33%
• Job Processing 33%
• Pseudo-polynomial Time Algorithm 33%
• Decreasing Function 33%
• Single Machine Scheduling Problem 33%
• Linear Decreasing 33%
• Total Resources 33%
• Resource Consumption Cost 33%
• Machine Unavailability 33%
• Total Processing Time 33%

Mathematics

• Single Machine 100%
• Polynomial Time 50%
• Minimizes 50%
• Fixed Number 50%
• Decreasing Function 50%
• Polynomial Approximation 50%
• Feasible Solution 50%

Computer Science

• Processing Time 100%
• Single Machine Scheduling 100%
• Approximation Algorithms 25%
• Polynomial Time Algorithm 25%
• Feasible Solution 25%
• Polynomial Approximation 25%
• single machine scheduling problem 25%
• Resource Consumption Cost 25%