Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

Keyphrases

• Algorithm Complexity 50%
• High multiplicity 50%
• Integer Programming Formulation 50%
• Low-complexity Algorithms 100%
• Machine Scheduling 50%
• Makespan 50%
• Parallel Machine Scheduling 50%
• Parallel Machine Scheduling Problem 50%
• Polynomial Time 50%
• Processing Time 100%
• Shamir 50%
• Single Machine Scheduling 100%
• Time Complexity 50%

Computer Science

• Algorithmic Efficiency 100%
• Integer Programming 50%
• Machine Scheduling Problem 100%
• Multiplicity 50%
• Parallel Machine Scheduling 100%
• Polynomial Time 50%
• Processing Time 100%
• Time Complexity 50%

Mathematics

• Fixed Number 100%
• Integer Programming 50%
• Polynomial 50%
• Polynomial Time 50%