Just-in-time scheduling with controllable processing times on parallel machines

Mathematics

• Controllable Processing Times 100%
• Parallel Machines 78%
• Scheduling 60%
• NP-complete problem 30%
• Due Dates 27%
• Fully Polynomial Time Approximation Scheme 27%
• Resource Allocation 25%
• Single Machine 24%
• Optimization Algorithm 21%
• Scheduling Problem 20%
• Maximise 18%
• Resources 18%
• Polynomial-time Algorithm 17%
• Objective function 16%
• Polynomial time 15%
• Minimise 15%
• Costs 14%
• Model 6%

Engineering & Materials Science

• Polynomials 45%
• Scheduling 40%
• NP-hard 38%
• Resource allocation 16%
• Costs 7%