Scheduling with step-improving processing times

Keyphrases

• Processing Time 100%
• Single Machine 50%
• Job Processing 50%
• NP-hardness Proof 50%
• Scheduling Problem 50%
• Makespan 50%
• Online Algorithms 50%
• Pseudo-polynomial Time Algorithm 50%
• FPTAS 50%
• Competitive Ratio 50%

Mathematics

• Competitive Ratio 100%
• Single Machine 100%
• Polynomial Time 100%
• Fully Polynomial-Time Approximation Scheme 100%

Computer Science

• Processing Time 100%
• Scheduling Problem 50%
• Fully Polynomial-Time Approximation Scheme 50%
• polynomial-time algorithm 50%
• on-line algorithm 50%
• Single Machine 50%
• Competitive Ratio 50%