A note on the complexity of the problem of two-agent scheduling on a single machine

Keyphrases

• Single Machine 100%
• Number of Tardy Jobs 100%
• Two-agent Scheduling 100%
• Pseudo-polynomial Time 50%
• Scheduling Problem 50%
• NP-hard 50%
• High multiplicity 50%
• Total Completion Time 50%
• Total Weighted Completion Time 50%
• Binary Encoding 50%
• Strong NP-hardness 50%

Computer Science

• Completion Time 100%
• Single Machine 100%
• Scheduling Problem 50%
• Binary Encoding 50%
• Multiplicity 50%
• Polynomial Time 50%

Mathematics

• Single Machine 100%
• Minimizes 100%
• Polynomial Time 50%