Single machine scheduling with a restricted rate-modifying activity

Computer Science

• Completion Time 100%
• Single Machine Scheduling 100%
• Optimal Algorithm 100%
• Polynomial Time 100%
• Computational Complexity 50%
• Fully Polynomial-Time Approximation Scheme 50%
• Processing Time 50%
• Single Machine 50%

Keyphrases

• Single Machine Scheduling 100%
• Rate-modifying Activity 100%
• Pseudo-polynomial Time 33%
• NP-hard 33%
• Total Completion Time 33%
• Time-optimal Algorithm 33%
• Processing Time 16%
• Single Machine 16%
• Computational Complexity 16%
• Makespan 16%
• Production Rate 16%
• Similar Problem 16%
• Time Problem 16%
• Makespan Minimization 16%
• Fully Polynomial Time Approximation Scheme 16%
• Hard Cases 16%

Mathematics

• Single Machine 100%
• Polynomial Time 100%
• time point η 50%
• Predetermined Time 50%
• Minimizes 50%
• Fully Polynomial-Time Approximation Scheme 50%