Question: what are np scheduling problems?
Answer: The complexity class NP itself is the class of all decision problems with efficiently verifiable solutions, where ”efficiently” = ”in time polynomial in the length of the input in binary”. A problem is a decision problem if its output is a yes/no answer.