Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan

Keyphrases

• Processing Time 100%
• Fully Polynomial Time Approximation Scheme 100%
• Makespan 100%
• Job Processing 100%
• Single Machine Scheduling 100%
• Unavailability Period 100%
• Controllable Processing Times 100%
• Constant-factor Approximation Algorithm 50%
• NP-hard 50%
• Resource Allocation 50%
• Processing Operations 50%
• Pseudo-polynomial Time Algorithm 50%
• Decreasing Function 50%
• Job Schedule 50%
• Single Machine Scheduling Problem 50%
• Total Resources 50%
• Machine Unavailability 50%
• Allocation Cost 50%
• Budget Constraint 50%

Mathematics

• Minimizes 100%
• Fully Polynomial-Time Approximation Scheme 100%
• Single Machine 100%
• Polynomial Time 50%
• Constant Factor 50%
• Decreasing Function 50%
• Cost Allocation 50%