NP-complete scheduling problems
Description: Scheduling problems classified as NP-complete, meaning their solutions can be verified in polynomial time and are as hard as every problem in NP.
Primary topic: Scheduling and Optimization Algorithms (50%)
OpenAlex ID: keywords/np-complete-scheduling-problems
